java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:38:08,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:38:08,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:38:08,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:38:08,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:38:08,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:38:08,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:38:08,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:38:08,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:38:08,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:38:08,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:38:08,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:38:08,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:38:08,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:38:08,332 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:38:08,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:38:08,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:38:08,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:38:08,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:38:08,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:38:08,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:38:08,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:38:08,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:38:08,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:38:08,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:38:08,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:38:08,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:38:08,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:38:08,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:38:08,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:38:08,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:38:08,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:38:08,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:38:08,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:38:08,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:38:08,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:38:08,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:38:08,377 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:38:08,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:38:08,379 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:38:08,379 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:38:08,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:38:08,379 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:38:08,380 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:38:08,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:38:08,380 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:38:08,380 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:38:08,380 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:38:08,381 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:38:08,381 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:38:08,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:38:08,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:38:08,382 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:38:08,382 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:38:08,382 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:38:08,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:38:08,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:38:08,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:38:08,383 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:38:08,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:38:08,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:38:08,384 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:38:08,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:38:08,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:38:08,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:38:08,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:38:08,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:38:08,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:08,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:38:08,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:38:08,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:38:08,386 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:38:08,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:38:08,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:38:08,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:38:08,387 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:38:08,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:38:08,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:38:08,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:38:08,457 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:38:08,457 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:38:08,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-20 10:38:08,459 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-20 10:38:08,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:38:08,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:38:08,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:08,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:38:08,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:38:08,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:08,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:38:08,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:38:08,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:38:08,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... [2019-01-20 10:38:08,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:38:08,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:38:08,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:38:08,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:38:08,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:08,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:38:08,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:08,941 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:08,942 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-20 10:38:08,943 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:08 BoogieIcfgContainer [2019-01-20 10:38:08,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:08,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:08,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:08,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:08,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:08" (1/2) ... [2019-01-20 10:38:08,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0641cf and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:08, skipping insertion in model container [2019-01-20 10:38:08,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:08" (2/2) ... [2019-01-20 10:38:08,951 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-20 10:38:08,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:08,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-20 10:38:08,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-20 10:38:09,022 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:09,023 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:09,023 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:09,023 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:09,023 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:09,023 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:09,024 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:09,024 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-20 10:38:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:09,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:09,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:09,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-20 10:38:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:09,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:09,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:09,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:09,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,275 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-20 10:38:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:09,488 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-20 10:38:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:09,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:09,504 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:38:09,504 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:38:09,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:38:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-20 10:38:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:38:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-20 10:38:09,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-20 10:38:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-20 10:38:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-20 10:38:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:09,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:09,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:09,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-20 10:38:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:09,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:09,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:09,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:09,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,635 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-20 10:38:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:09,833 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-20 10:38:09,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:09,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:09,835 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:38:09,835 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:38:09,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:38:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-20 10:38:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:38:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-20 10:38:09,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-20 10:38:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:09,842 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-20 10:38:09,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-20 10:38:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:09,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:09,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:09,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-20 10:38:09,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:09,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:09,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:09,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:09,994 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-20 10:38:10,079 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:10,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:11,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:11,066 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:11,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:11,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:11,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:11,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:11,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:11,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:11,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:11,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:11,421 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:38:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:11,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:11,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:11,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:11,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:11,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:11,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:11,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:11,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:11,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:11,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:11,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:11,919 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:12,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:12,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:12,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:12,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:12,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:12,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:12,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:38:12,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:12,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:12,326 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-20 10:38:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:12,430 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-20 10:38:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:38:12,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:38:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:12,432 INFO L225 Difference]: With dead ends: 13 [2019-01-20 10:38:12,432 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:38:12,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:38:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-20 10:38:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:38:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-20 10:38:12,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-20 10:38:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:12,437 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-20 10:38:12,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-20 10:38:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:12,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:12,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:12,438 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-20 10:38:12,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:12,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:12,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:12,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:12,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:12,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:12,502 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-20 10:38:12,505 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:12,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:12,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:12,937 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:12,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:12,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:12,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:12,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:12,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:13,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:13,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:13,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:13,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:13,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:13,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:13,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:13,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:13,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:13,566 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:13,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:38:13,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:13,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:13,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:13,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:13,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:13,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:13,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:13,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:13,776 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-20 10:38:14,088 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-20 10:38:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:14,435 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-20 10:38:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:14,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:38:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:14,437 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:38:14,437 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:38:14,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:38:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-20 10:38:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:38:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-20 10:38:14,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-20 10:38:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:14,443 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-20 10:38:14,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-20 10:38:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:14,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:14,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:14,444 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-20 10:38:14,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:14,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:14,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:14,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:14,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:14,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:14,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:14,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:14,465 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-20 10:38:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:14,503 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-20 10:38:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:14,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:38:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:14,504 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:38:14,504 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:38:14,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:38:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 10:38:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:38:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-20 10:38:14,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-20 10:38:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:14,510 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-20 10:38:14,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-20 10:38:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:14,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:14,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:14,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-20 10:38:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:14,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:14,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:14,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:14,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:14,565 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-20 10:38:14,567 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:14,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:14,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:14,881 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:14,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:14,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:14,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:14,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:14,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:14,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:15,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:15,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:15,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:15,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:15,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:15,103 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:15,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:15,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:15,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:15,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:15,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:15,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:15,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:15,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:15,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:15,249 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-20 10:38:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:15,441 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-20 10:38:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:15,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:38:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:15,442 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:38:15,442 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:38:15,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:38:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-20 10:38:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:38:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-20 10:38:15,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-20 10:38:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:15,448 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-20 10:38:15,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-20 10:38:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:15,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:15,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:15,449 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-20 10:38:15,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:15,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:15,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:15,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:15,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:15,541 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-20 10:38:15,542 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:15,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:15,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:15,959 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:15,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:15,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:15,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:15,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:16,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:16,143 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-20 10:38:16,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:16,477 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:38:16,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:16,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:16,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:16,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:16,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:16,567 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:16,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:16,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:16,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:16,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:38:16,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:16,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:16,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-20 10:38:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:16,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:16,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:16,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:16,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:16,810 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-20 10:38:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:17,047 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-20 10:38:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:17,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:17,049 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:38:17,049 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 10:38:17,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 10:38:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-20 10:38:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:38:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-20 10:38:17,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-20 10:38:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:17,056 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-20 10:38:17,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-20 10:38:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:17,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:17,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:17,058 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-20 10:38:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:17,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:17,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:17,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:17,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:17,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:17,111 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-20 10:38:17,114 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:17,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:17,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:17,348 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:17,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:17,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:17,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:17,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:17,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:17,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:17,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:17,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:38:17,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-20 10:38:17,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:17,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:17,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:17,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:17,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-20 10:38:17,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:17,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:38:17,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:17,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:17,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:38:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:17,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-20 10:38:17,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:17,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:38:17,773 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-20 10:38:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:17,847 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-20 10:38:17,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:38:17,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:17,849 INFO L225 Difference]: With dead ends: 30 [2019-01-20 10:38:17,849 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:38:17,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:38:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:38:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-20 10:38:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:38:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-20 10:38:17,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-20 10:38:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:17,858 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-20 10:38:17,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-20 10:38:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:17,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:17,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:17,859 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-20 10:38:17,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:17,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:17,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:17,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:17,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:17,966 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-20 10:38:17,968 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:17,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:18,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:18,383 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:18,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:18,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:18,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:18,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:18,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:18,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:18,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:18,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:18,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:18,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:18,621 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,639 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:18,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:38:18,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,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. [2019-01-20 10:38:18,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:18,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:38:18,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:18,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:18,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-20 10:38:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:18,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:18,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:38:18,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:18,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:18,791 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-20 10:38:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:19,097 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-20 10:38:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:19,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:19,099 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:38:19,099 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:38:19,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:38:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-20 10:38:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:38:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-20 10:38:19,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-20 10:38:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:19,112 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-20 10:38:19,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-20 10:38:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:19,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:19,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:19,113 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-20 10:38:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:19,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:19,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:19,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:19,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:19,163 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-20 10:38:19,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:19,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:21,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:21,590 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:21,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:21,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:21,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:21,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:21,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:21,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:38:21,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:21,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:38:21,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:21,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:38:21,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:38:21,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:21,717 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:38:21,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:21,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 [2019-01-20 10:38:21,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:21,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:21,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-20 10:38:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:21,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:21,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:21,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:21,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:21,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:21,808 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-20 10:38:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:22,001 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-20 10:38:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:22,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:38:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:22,003 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:38:22,003 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:38:22,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:38:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-20 10:38:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:38:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-20 10:38:22,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-20 10:38:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:22,014 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-20 10:38:22,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-20 10:38:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:22,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:22,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:22,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-20 10:38:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:22,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:22,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:22,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:22,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:22,095 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-20 10:38:22,096 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:22,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:22,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:22,317 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:22,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:22,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:22,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:22,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:22,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:22,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:22,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:22,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:38:22,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:22,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:22,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:38:22,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:38:22,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:22,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:22,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:38:22,431 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:22,453 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:38:22,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:22,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:38:22,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:22,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:22,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-20 10:38:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:22,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:22,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:22,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-20 10:38:22,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:22,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:22,542 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-20 10:38:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:22,601 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-20 10:38:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:22,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:38:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:22,603 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:38:22,603 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:38:22,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:38:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-20 10:38:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:38:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-20 10:38:22,613 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-20 10:38:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:22,613 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-20 10:38:22,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-20 10:38:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:22,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:22,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:22,614 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-20 10:38:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:22,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:38:22,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:22,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:22,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:22,666 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-20 10:38:22,667 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:22,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:22,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:22,993 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:22,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:22,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:22,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:23,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:23,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:23,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:23,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:23,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:23,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:23,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:23,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:23,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,164 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:23,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:23,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:23,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:23,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:23,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:38:23,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:23,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:38:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:23,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:23,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:23,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:38:23,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:23,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:38:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:38:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:23,307 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-20 10:38:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:23,457 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-20 10:38:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:23,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:38:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:23,460 INFO L225 Difference]: With dead ends: 38 [2019-01-20 10:38:23,460 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:38:23,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:38:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-20 10:38:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:38:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-20 10:38:23,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-20 10:38:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:23,473 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-20 10:38:23,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:38:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-20 10:38:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:23,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:23,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:23,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-20 10:38:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:23,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:23,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:23,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:23,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:23,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:23,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:23,556 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-20 10:38:23,559 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:23,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:23,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:23,840 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:23,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:23,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:23,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:23,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:23,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:23,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:23,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-20 10:38:23,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:23,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:23,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-20 10:38:23,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:23,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-20 10:38:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:23,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:38:23,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:23,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:38:24,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:38:24,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:24,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:38:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:24,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:24,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:24,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:24,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:24,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:24,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:24,099 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-20 10:38:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:24,427 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-20 10:38:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:24,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:38:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:24,429 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:38:24,429 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:38:24,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:38:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-20 10:38:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:38:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-20 10:38:24,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-20 10:38:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:24,440 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-20 10:38:24,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-20 10:38:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:24,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:24,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:24,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-20 10:38:24,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:24,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:24,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:24,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:24,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:24,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:24,519 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-20 10:38:24,520 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:24,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:24,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:24,775 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:24,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:24,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:24,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:24,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:24,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:24,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:24,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:38:24,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:38:24,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:38:24,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:38:24,920 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:24,937 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:38:24,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:24,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:38:24,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:24,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:38:25,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:25,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:25,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:25,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:25,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:38:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:25,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:25,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:38:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:25,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:25,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:25,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:25,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:25,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:25,139 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-20 10:38:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:25,330 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-20 10:38:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:25,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:38:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:25,332 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:38:25,332 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:38:25,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:38:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-20 10:38:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:38:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-20 10:38:25,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-20 10:38:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-20 10:38:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-20 10:38:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:25,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:25,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:25,356 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-20 10:38:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:25,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:25,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:25,500 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-20 10:38:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:25,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:25,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:25,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:25,547 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-20 10:38:25,549 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:25,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:25,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:25,983 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:38:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:25,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:25,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:25,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:25,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:25,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:25,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:26,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:26,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:26,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:26,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:26,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:26,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:38:26,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:26,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,181 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:26,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:38:26,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:26,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-20 10:38:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:26,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:38:26,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:26,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:26,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:38:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:26,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:38:26,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:26,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:38:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:38:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:26,361 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-20 10:38:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:26,590 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-20 10:38:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:26,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:38:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:26,592 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:38:26,592 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:38:26,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:38:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:38:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-20 10:38:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:38:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-20 10:38:26,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-20 10:38:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:26,603 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-20 10:38:26,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:38:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-20 10:38:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:38:26,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:26,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:38:26,604 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-20 10:38:26,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:26,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:26,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:26,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:26,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:26,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:26,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:38:26,813 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-20 10:38:26,815 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:26,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:27,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:27,061 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:27,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:27,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:27,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:27,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:27,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:27,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:27,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:38:27,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:38:27,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:38:27,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:38:27,148 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,163 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-20 10:38:27,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:27,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:38:27,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:38:27,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-20 10:38:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-20 10:38:27,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:27,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:27,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:38:27,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:27,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:38:27,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-20 10:38:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:27,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:27,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:27,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-20 10:38:27,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:27,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:38:27,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:38:27,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:27,440 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-20 10:38:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:27,742 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-20 10:38:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:27,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:38:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:27,743 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:38:27,743 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:38:27,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:38:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:38:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-20 10:38:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:38:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-20 10:38:27,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-20 10:38:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:27,755 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-20 10:38:27,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:38:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-20 10:38:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:38:27,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:27,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:38:27,756 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-20 10:38:27,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:27,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:27,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:38:27,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:27,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:27,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:38:27,853 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-20 10:38:27,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:27,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:28,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:28,200 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:38:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:28,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:28,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:28,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:28,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:28,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:28,367 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-20 10:38:28,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:28,546 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:38:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:38:28,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:38:28,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:38:28,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:38:28,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:38:28,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:38:28,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:28,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:38:28,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,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. [2019-01-20 10:38:28,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-20 10:38:28,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:28,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:38:28,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:28,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:28,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-20 10:38:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:28,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:28,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:38:28,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:38:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:38:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:38:28,799 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-20 10:38:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:29,047 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-20 10:38:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:29,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:38:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:29,049 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:38:29,049 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:38:29,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:38:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:38:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:38:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:38:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:38:29,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-20 10:38:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:29,051 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:38:29,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:38:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:38:29,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:38:29,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:38:29,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:38:29,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:38:29,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:38:29,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:38:29,224 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-20 10:38:31,473 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-20 10:38:31,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-20 10:38:31,477 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-20 10:38:31,487 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:38:31 BoogieIcfgContainer [2019-01-20 10:38:31,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:38:31,487 INFO L168 Benchmark]: Toolchain (without parser) took 22979.75 ms. Allocated memory was 134.2 MB in the beginning and 624.4 MB in the end (delta: 490.2 MB). Free memory was 105.9 MB in the beginning and 556.3 MB in the end (delta: -450.4 MB). Peak memory consumption was 516.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:38:31,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:38:31,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 134.2 MB. Free memory was 105.4 MB in the beginning and 103.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:38:31,488 INFO L168 Benchmark]: Boogie Preprocessor took 23.60 ms. Allocated memory is still 134.2 MB. Free memory was 103.3 MB in the beginning and 102.4 MB in the end (delta: 892.8 kB). Peak memory consumption was 892.8 kB. Max. memory is 7.1 GB. [2019-01-20 10:38:31,488 INFO L168 Benchmark]: RCFGBuilder took 353.24 ms. Allocated memory is still 134.2 MB. Free memory was 102.0 MB in the beginning and 92.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-01-20 10:38:31,489 INFO L168 Benchmark]: TraceAbstraction took 22542.38 ms. Allocated memory was 134.2 MB in the beginning and 624.4 MB in the end (delta: 490.2 MB). Free memory was 92.0 MB in the beginning and 556.3 MB in the end (delta: -464.2 MB). Peak memory consumption was 502.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:38:31,490 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.24 ms. Allocated memory is still 134.2 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 134.2 MB. Free memory was 105.4 MB in the beginning and 103.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.60 ms. Allocated memory is still 134.2 MB. Free memory was 103.3 MB in the beginning and 102.4 MB in the end (delta: 892.8 kB). Peak memory consumption was 892.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 353.24 ms. Allocated memory is still 134.2 MB. Free memory was 102.0 MB in the beginning and 92.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22542.38 ms. Allocated memory was 134.2 MB in the beginning and 624.4 MB in the end (delta: 490.2 MB). Free memory was 92.0 MB in the beginning and 556.3 MB in the end (delta: -464.2 MB). Peak memory consumption was 502.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 22.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.4s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...