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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:33,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:33,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:33,438 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:33,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:33,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:33,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:33,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:33,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:33,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:33,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:33,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:33,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:33,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:33,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:33,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:33,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:33,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:33,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:33,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:33,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:33,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:33,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:33,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:33,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:33,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:33,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:33,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:33,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:33,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:33,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:33,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:33,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:33,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:33,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:33,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:33,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:33,482 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:33,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:33,483 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:33,483 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:33,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:33,484 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:33,484 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:33,484 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:33,484 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:33,485 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:33,485 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:33,485 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:33,485 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:33,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:33,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:33,486 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:33,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:33,487 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:33,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:33,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:33,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:33,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:33,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:33,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:33,488 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:33,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:33,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:33,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:33,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:33,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:33,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:33,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:33,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:33,490 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:33,490 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:33,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:33,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:33,491 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:33,491 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:33,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:33,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:33,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:33,559 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:33,559 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:33,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-03-04 16:38:33,560 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-03-04 16:38:33,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:33,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:33,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:33,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:33,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:33,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:33,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:33,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:33,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:33,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/1) ... [2019-03-04 16:38:33,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:33,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:33,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:33,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:33,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (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-03-04 16:38:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:33,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:33,973 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:33,974 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-03-04 16:38:33,975 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:33 BoogieIcfgContainer [2019-03-04 16:38:33,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:33,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:33,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:33,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:33,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:33" (1/2) ... [2019-03-04 16:38:33,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7559e6ad and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:33, skipping insertion in model container [2019-03-04 16:38:33,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:33" (2/2) ... [2019-03-04 16:38:33,983 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-03-04 16:38:33,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:34,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-03-04 16:38:34,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-03-04 16:38:34,049 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:34,050 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:34,050 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:34,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:34,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:34,050 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:34,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:34,051 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-03-04 16:38:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:38:34,072 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:38:34,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-03-04 16:38:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:34,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:34,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:34,296 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-03-04 16:38:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:34,500 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-03-04 16:38:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:34,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:38:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:34,514 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:38:34,515 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:38:34,518 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-03-04 16:38:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:38:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-03-04 16:38:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:38:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-03-04 16:38:34,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-03-04 16:38:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:34,557 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-03-04 16:38:34,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-03-04 16:38:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:34,558 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:34,558 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-03-04 16:38:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:34,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:34,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:34,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:34,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:34,642 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-03-04 16:38:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:34,713 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-03-04 16:38:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:34,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:34,715 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:38:34,715 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:38:34,716 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-03-04 16:38:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:38:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-03-04 16:38:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:38:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-03-04 16:38:34,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-03-04 16:38:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:34,720 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-03-04 16:38:34,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-03-04 16:38:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:34,721 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:34,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-03-04 16:38:34,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:34,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:34,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:34,791 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-03-04 16:38:34,868 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:34,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:34,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:34,942 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:34,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:34,952 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-03-04 16:38:34,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:34,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:35,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:35,106 INFO L453 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-03-04 16:38:35,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,158 INFO L453 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 17 [2019-03-04 16:38:35,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,190 INFO L453 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 16 [2019-03-04 16:38:35,191 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,241 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,254 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,336 INFO L309 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-03-04 16:38:35,337 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:35,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:35,444 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:35,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,479 INFO L309 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-03-04 16:38:35,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:35,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:38:35,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:35,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:35,558 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-03-04 16:38:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:35,789 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-03-04 16:38:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:35,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:38:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:35,791 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:38:35,791 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:38:35,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:38:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-03-04 16:38:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:38:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-03-04 16:38:35,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-03-04 16:38:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:35,797 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-03-04 16:38:35,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-03-04 16:38:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:35,798 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:35,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:35,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-03-04 16:38:35,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:36,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:36,073 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-03-04 16:38:36,077 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:36,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:36,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:36,085 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:36,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,086 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-03-04 16:38:36,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:36,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:36,139 INFO L453 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-03-04 16:38:36,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,154 INFO L453 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 17 [2019-03-04 16:38:36,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,172 INFO L453 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 16 [2019-03-04 16:38:36,173 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,183 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,193 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,228 INFO L309 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-03-04 16:38:36,228 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:36,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:36,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:36,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,355 INFO L309 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-03-04 16:38:36,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:36,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:36,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:36,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:36,418 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-03-04 16:38:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:36,848 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-03-04 16:38:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:36,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:36,849 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:38:36,849 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:38:36,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:38:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-03-04 16:38:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:38:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-03-04 16:38:36,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-03-04 16:38:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:36,855 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-03-04 16:38:36,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-03-04 16:38:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:36,856 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:36,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:36,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-03-04 16:38:36,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:36,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:36,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:36,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:36,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:36,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:36,926 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-03-04 16:38:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:37,005 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-03-04 16:38:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:37,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:38:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:37,007 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:38:37,007 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:38:37,007 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-03-04 16:38:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:38:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:38:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:38:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-03-04 16:38:37,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-03-04 16:38:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:37,013 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-03-04 16:38:37,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-03-04 16:38:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:37,014 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:37,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:37,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-03-04 16:38:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:37,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:37,131 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-03-04 16:38:37,135 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:37,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:37,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:37,143 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:37,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,143 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-03-04 16:38:37,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:37,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:37,173 INFO L453 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-03-04 16:38:37,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,182 INFO L453 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 17 [2019-03-04 16:38:37,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,199 INFO L453 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 16 [2019-03-04 16:38:37,200 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,230 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,241 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,252 INFO L309 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-03-04 16:38:37,253 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:37,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:37,295 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,313 INFO L309 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-03-04 16:38:37,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:37,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:37,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:37,397 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-03-04 16:38:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:37,571 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-03-04 16:38:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:37,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:37,573 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:37,573 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:37,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-03-04 16:38:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:38:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-03-04 16:38:37,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-03-04 16:38:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:37,580 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-03-04 16:38:37,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-03-04 16:38:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:37,581 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:37,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:37,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-03-04 16:38:37,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:37,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:37,691 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-03-04 16:38:37,693 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:37,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:37,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:37,697 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:37,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,698 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-03-04 16:38:37,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:37,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:37,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:37,743 INFO L453 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-03-04 16:38:37,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,757 INFO L453 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 17 [2019-03-04 16:38:37,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,775 INFO L453 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 16 [2019-03-04 16:38:37,776 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,785 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,799 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,825 INFO L309 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-03-04 16:38:37,825 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:37,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:37,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,922 INFO L309 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-03-04 16:38:37,922 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:37,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:37,966 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:37,967 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:37,983 INFO L309 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-03-04 16:38:37,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:38,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:38,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:38,126 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-03-04 16:38:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,413 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-03-04 16:38:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:38,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,414 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:38:38,414 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:38:38,415 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-03-04 16:38:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:38:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-03-04 16:38:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-03-04 16:38:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-03-04 16:38:38,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-03-04 16:38:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,426 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-03-04 16:38:38,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-03-04 16:38:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:38,426 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:38,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-03-04 16:38:38,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,469 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:38,469 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-03-04 16:38:38,473 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:38,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:38,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:38,477 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:38,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,478 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-03-04 16:38:38,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,509 INFO L453 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-03-04 16:38:38,542 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-03-04 16:38:38,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-03-04 16:38:38,572 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,592 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,601 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,613 INFO L309 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-03-04 16:38:38,614 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-03-04 16:38:38,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:38:38,681 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,700 INFO L309 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-03-04 16:38:38,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:38:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:38,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:38:38,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:38,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:38,742 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-03-04 16:38:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,787 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-03-04 16:38:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:38,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:38:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,788 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:38:38,789 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:38:38,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:38:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-03-04 16:38:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:38:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-03-04 16:38:38,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-03-04 16:38:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,797 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-03-04 16:38:38,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-03-04 16:38:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:38,798 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:38,798 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-03-04 16:38:38,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:38,914 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-03-04 16:38:38,917 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:38,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:38,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:38,921 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:38,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,922 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-03-04 16:38:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,947 INFO L453 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-03-04 16:38:38,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,955 INFO L453 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 17 [2019-03-04 16:38:38,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:38,965 INFO L453 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 16 [2019-03-04 16:38:38,966 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,973 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,980 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,991 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,991 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:39,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:39,116 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,161 INFO L309 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-03-04 16:38:39,162 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:39,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:38:39,204 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,248 INFO L309 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-03-04 16:38:39,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:38:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:39,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:39,308 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-03-04 16:38:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:39,526 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-03-04 16:38:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:39,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:39,529 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:39,529 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:38:39,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:38:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-03-04 16:38:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:38:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-03-04 16:38:39,539 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-03-04 16:38:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:39,539 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-03-04 16:38:39,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-03-04 16:38:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:39,540 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:39,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:39,540 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-03-04 16:38:39,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:39,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:39,609 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-03-04 16:38:39,612 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:39,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:39,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:39,616 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:39,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:39,617 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-03-04 16:38:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:39,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:38:39,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:39,637 INFO L453 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-03-04 16:38:39,654 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-03-04 16:38:39,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-03-04 16:38:39,673 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,686 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,691 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,700 INFO L309 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-03-04 16:38:39,701 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-03-04 16:38:39,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:39,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:38:39,733 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,748 INFO L309 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-03-04 16:38:39,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:38:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:39,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:39,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:39,804 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-03-04 16:38:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:39,896 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-03-04 16:38:39,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:39,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:39,901 INFO L225 Difference]: With dead ends: 38 [2019-03-04 16:38:39,901 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:38:39,902 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-03-04 16:38:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:38:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-03-04 16:38:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:38:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-03-04 16:38:39,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-03-04 16:38:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:39,916 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-03-04 16:38:39,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-03-04 16:38:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:39,918 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:39,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:39,919 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-03-04 16:38:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:39,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,247 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:38:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:40,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:40,318 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-03-04 16:38:40,319 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:40,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:40,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:40,326 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:40,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,327 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-03-04 16:38:40,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:40,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:40,349 INFO L453 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-03-04 16:38:40,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,354 INFO L453 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 17 [2019-03-04 16:38:40,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,367 INFO L453 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 16 [2019-03-04 16:38:40,367 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,376 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,383 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,392 INFO L309 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-03-04 16:38:40,393 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:40,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:40,415 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,424 INFO L309 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-03-04 16:38:40,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:40,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:38:40,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:40,524 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-03-04 16:38:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:40,624 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-03-04 16:38:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:40,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:38:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:40,626 INFO L225 Difference]: With dead ends: 38 [2019-03-04 16:38:40,627 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:38:40,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:38:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:38:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:38:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-03-04 16:38:40,637 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-03-04 16:38:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:40,637 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-03-04 16:38:40,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-03-04 16:38:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:40,638 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:40,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:40,638 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-03-04 16:38:40,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:40,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:40,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:40,793 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-03-04 16:38:40,794 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:40,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:40,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:40,799 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:40,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,800 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-03-04 16:38:40,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:40,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:40,820 INFO L453 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-03-04 16:38:40,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,825 INFO L453 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 17 [2019-03-04 16:38:40,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,837 INFO L453 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 16 [2019-03-04 16:38:40,837 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,846 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,854 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,866 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,867 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:40,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:40,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,898 INFO L309 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-03-04 16:38:40,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:40,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:40,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:40,956 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,966 INFO L309 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-03-04 16:38:40,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:41,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:41,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:41,031 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-03-04 16:38:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:41,434 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-03-04 16:38:41,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:41,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:41,437 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:38:41,437 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:38:41,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:38:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-03-04 16:38:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:38:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-03-04 16:38:41,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-03-04 16:38:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:41,446 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-03-04 16:38:41,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-03-04 16:38:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:41,447 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:41,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:41,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-03-04 16:38:41,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:41,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:41,525 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-03-04 16:38:41,529 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:41,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:41,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:41,532 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:41,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,533 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-03-04 16:38:41,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:41,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:41,560 INFO L453 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-03-04 16:38:41,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,568 INFO L453 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 17 [2019-03-04 16:38:41,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,581 INFO L453 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 16 [2019-03-04 16:38:41,582 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,592 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,599 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,617 INFO L309 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-03-04 16:38:41,617 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:41,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,642 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:41,643 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,652 INFO L309 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-03-04 16:38:41,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:41,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:38:41,720 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,748 INFO L309 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-03-04 16:38:41,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:38:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:41,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:41,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:41,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:41,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:41,805 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-03-04 16:38:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:42,129 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-03-04 16:38:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:42,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:42,131 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:42,132 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:42,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-03-04 16:38:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:38:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-03-04 16:38:42,142 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-03-04 16:38:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:42,142 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-03-04 16:38:42,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-03-04 16:38:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:42,143 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:42,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:42,144 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-03-04 16:38:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:42,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:42,304 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-03-04 16:38:42,306 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:42,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:42,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:42,314 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:42,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:42,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:42,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:42,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:42,347 INFO L453 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-03-04 16:38:42,362 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-03-04 16:38:42,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-03-04 16:38:42,421 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,432 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,437 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,445 INFO L309 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-03-04 16:38:42,446 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-03-04 16:38:42,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:38:42,476 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,482 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,482 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:38:42,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:38:42,498 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,504 INFO L309 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-03-04 16:38:42,504 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:38:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:42,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:42,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:42,602 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-03-04 16:38:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:42,827 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-03-04 16:38:42,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:42,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:42,828 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:42,828 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:42,828 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-03-04 16:38:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-03-04 16:38:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:38:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-03-04 16:38:42,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-03-04 16:38:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:42,836 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-03-04 16:38:42,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-03-04 16:38:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:42,837 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:42,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:42,837 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-03-04 16:38:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,080 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-03-04 16:38:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:43,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:43,143 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-03-04 16:38:43,144 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:43,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:43,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:43,147 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:38:43,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:43,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,148 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-03-04 16:38:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:43,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:43,165 INFO L453 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-03-04 16:38:43,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,175 INFO L453 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 17 [2019-03-04 16:38:43,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,184 INFO L453 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 16 [2019-03-04 16:38:43,185 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,193 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,202 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,218 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,219 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:43,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:43,243 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,254 INFO L309 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-03-04 16:38:43,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:43,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:43,278 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,287 INFO L309 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-03-04 16:38:43,287 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:43,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:43,309 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,319 INFO L309 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-03-04 16:38:43,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:43,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:43,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:43,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:43,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:43,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:43,397 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-03-04 16:38:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:43,825 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-03-04 16:38:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:43,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:43,827 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:43,827 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:43,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:38:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-03-04 16:38:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:38:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-03-04 16:38:43,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-03-04 16:38:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:43,840 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-03-04 16:38:43,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-03-04 16:38:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:43,841 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:43,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:43,842 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-03-04 16:38:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:44,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:44,011 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-03-04 16:38:44,012 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:44,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:44,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:44,016 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:44,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,017 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-03-04 16:38:44,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:44,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:44,083 INFO L453 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-03-04 16:38:44,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,098 INFO L453 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 17 [2019-03-04 16:38:44,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,115 INFO L453 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 16 [2019-03-04 16:38:44,115 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,130 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,138 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,147 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,147 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:44,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:44,171 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,181 INFO L309 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-03-04 16:38:44,182 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:44,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:44,203 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,213 INFO L309 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-03-04 16:38:44,213 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:44,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:44,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:44,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:44,279 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-03-04 16:38:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,428 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-03-04 16:38:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:44,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:38:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,429 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:38:44,429 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:38:44,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:38:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-03-04 16:38:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:38:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-03-04 16:38:44,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-03-04 16:38:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,438 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-03-04 16:38:44,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-03-04 16:38:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:44,439 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:44,439 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-03-04 16:38:44,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:44,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:44,620 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-03-04 16:38:44,621 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:44,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:44,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:44,624 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:38:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:44,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:44,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:44,677 INFO L453 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-03-04 16:38:44,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,684 INFO L453 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 17 [2019-03-04 16:38:44,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,694 INFO L453 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 16 [2019-03-04 16:38:44,694 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,704 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,709 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,720 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-03-04 16:38:44,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:44,746 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,766 INFO L309 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-03-04 16:38:44,766 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:38:44,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:44,793 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,806 INFO L309 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-03-04 16:38:44,806 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:44,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:38:44,829 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,838 INFO L309 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-03-04 16:38:44,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:38:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:44,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:38:44,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:44,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:44,914 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-03-04 16:38:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:45,147 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-03-04 16:38:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:45,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:38:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:45,148 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:38:45,148 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:38:45,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:38:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:38:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-03-04 16:38:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:38:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-03-04 16:38:45,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-03-04 16:38:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:45,155 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-03-04 16:38:45,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-03-04 16:38:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:45,156 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:45,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:45,156 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-03-04 16:38:45,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:45,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:45,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:45,238 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-03-04 16:38:45,239 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:45,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:45,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:45,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:45,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:45,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:45,264 INFO L453 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-03-04 16:38:45,278 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 20 [2019-03-04 16:38:45,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 19 [2019-03-04 16:38:45,296 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,306 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,314 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,321 INFO L309 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-03-04 16:38:45,322 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-03-04 16:38:45,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:38:45,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,361 INFO L309 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-03-04 16:38:45,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:38:45,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:38:45,435 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,442 INFO L309 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-03-04 16:38:45,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:38:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:45,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:45,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:45,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:38:45,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:45,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:45,567 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-03-04 16:38:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:45,868 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-03-04 16:38:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:45,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:38:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:45,869 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:38:45,869 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:38:45,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:38:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:38:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:38:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:38:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:38:45,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-03-04 16:38:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:45,871 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:38:45,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:38:45,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:38:45,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:38:46,028 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 135 [2019-03-04 16:38:47,735 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 131 DAG size of output: 36 [2019-03-04 16:38:47,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:38:47,739 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse4 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse5 (<= 0 .cse4)) (.cse2 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse3 (= 0 .cse0))) (or (and (let ((.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse4 1)) ULTIMATE.start_main_p2))) (or (and (<= 1 .cse0) (<= .cse1 0)) (and (<= (+ .cse1 1) 0) .cse2 .cse3))) .cse5) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 .cse2 (= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0) .cse3)))) [2019-03-04 16:38:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:38:47,739 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-03-04 16:38:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-03-04 16:38:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-03-04 16:38:47,739 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-03-04 16:38:47,740 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-03-04 16:38:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-03-04 16:38:47,749 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:38:47 BoogieIcfgContainer [2019-03-04 16:38:47,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:38:47,750 INFO L168 Benchmark]: Toolchain (without parser) took 14153.31 ms. Allocated memory was 141.0 MB in the beginning and 312.0 MB in the end (delta: 170.9 MB). Free memory was 107.2 MB in the beginning and 225.6 MB in the end (delta: -118.3 MB). Peak memory consumption was 164.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:47,751 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:47,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.92 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:47,751 INFO L168 Benchmark]: Boogie Preprocessor took 33.59 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:47,752 INFO L168 Benchmark]: RCFGBuilder took 285.93 ms. Allocated memory is still 141.0 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:47,752 INFO L168 Benchmark]: TraceAbstraction took 13773.49 ms. Allocated memory was 141.0 MB in the beginning and 312.0 MB in the end (delta: 170.9 MB). Free memory was 93.8 MB in the beginning and 225.6 MB in the end (delta: -131.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:47,754 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.92 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 285.93 ms. Allocated memory is still 141.0 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13773.49 ms. Allocated memory was 141.0 MB in the beginning and 312.0 MB in the end (delta: 170.9 MB). Free memory was 93.8 MB in the beginning and 225.6 MB in the end (delta: -131.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p3 := #memory_int[p3] + 1][p2] <= 0) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 <= #memory_int[p3]) || ((((!(p3 == p2) && 0 <= #memory_int[p3]) && p1 + 1 < p3) && #memory_int[p1 := #memory_int[p1] + 1][p2] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 104 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5338 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4868 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...