java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:51:02,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:51:02,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:51:02,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:51:02,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:51:02,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:51:02,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:51:02,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:51:02,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:51:02,547 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:51:02,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:51:02,548 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:51:02,549 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:51:02,550 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:51:02,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:51:02,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:51:02,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:51:02,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:51:02,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:51:02,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:51:02,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:51:02,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:51:02,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:51:02,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:51:02,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:51:02,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:51:02,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:51:02,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:51:02,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:51:02,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:51:02,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:51:02,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:51:02,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:51:02,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:51:02,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:51:02,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:51:02,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:51:02,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:51:02,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:51:02,587 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:51:02,587 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:51:02,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:51:02,587 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:51:02,587 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:51:02,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:51:02,588 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:51:02,588 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:51:02,588 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:51:02,588 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:51:02,589 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:51:02,589 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:51:02,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:51:02,590 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:51:02,590 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:51:02,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:51:02,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:51:02,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:51:02,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:51:02,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:51:02,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:51:02,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:51:02,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:51:02,592 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:51:02,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:51:02,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:51:02,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:51:02,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:51:02,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:51:02,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:02,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:51:02,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:51:02,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:51:02,595 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:51:02,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:51:02,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:51:02,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:51:02,596 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:51:02,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:51:02,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:51:02,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:51:02,651 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:51:02,652 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:51:02,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2018-12-24 13:51:02,653 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2018-12-24 13:51:02,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:51:02,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:51:02,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:02,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:51:02,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:51:02,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:02,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:51:02,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:51:02,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:51:02,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... [2018-12-24 13:51:02,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:51:02,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:51:02,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:51:02,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:51:02,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:51:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:51:03,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:51:03,110 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-24 13:51:03,111 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:03 BoogieIcfgContainer [2018-12-24 13:51:03,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:51:03,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:51:03,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:51:03,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:51:03,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:02" (1/2) ... [2018-12-24 13:51:03,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f655c5 and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:51:03, skipping insertion in model container [2018-12-24 13:51:03,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:03" (2/2) ... [2018-12-24 13:51:03,122 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2018-12-24 13:51:03,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:51:03,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-24 13:51:03,163 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-24 13:51:03,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:51:03,206 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:51:03,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:51:03,206 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:51:03,207 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:51:03,207 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:51:03,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:51:03,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:51:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 13:51:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:51:03,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:03,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:51:03,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2018-12-24 13:51:03,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:03,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:03,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:03,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:03,459 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 13:51:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:03,630 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-24 13:51:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:03,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:51:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:03,647 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:51:03,647 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 13:51:03,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 13:51:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-12-24 13:51:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:51:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-24 13:51:03,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2018-12-24 13:51:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:03,696 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-24 13:51:03,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-24 13:51:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:03,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:03,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:03,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2018-12-24 13:51:03,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:03,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:03,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:03,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:03,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:03,925 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2018-12-24 13:51:03,970 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:03,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:04,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:04,058 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:04,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:04,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:04,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:04,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:04,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-24 13:51:04,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:04,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:04,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:04,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2018-12-24 13:51:04,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:04,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:04,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:04,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:04,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:04,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:04,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:04,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:04,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:04,403 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-24 13:51:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:04,565 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2018-12-24 13:51:04,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:04,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:51:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:04,567 INFO L225 Difference]: With dead ends: 10 [2018-12-24 13:51:04,567 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:51:04,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:51:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-24 13:51:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:51:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-12-24 13:51:04,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2018-12-24 13:51:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:04,572 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2018-12-24 13:51:04,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2018-12-24 13:51:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:04,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:04,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:04,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2018-12-24 13:51:04,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:04,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:04,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:04,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:04,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:04,860 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-24 13:51:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:04,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:04,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:04,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:04,871 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2018-12-24 13:51:04,876 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:04,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:04,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:04,882 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:04,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:04,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:04,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:04,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:04,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:04,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-24 13:51:04,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:04,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:04,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:04,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-24 13:51:05,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:05,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:05,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:05,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:05,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:05,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:05,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:05,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:05,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:05,128 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-12-24 13:51:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:05,354 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-24 13:51:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:05,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:05,355 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:51:05,355 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:51:05,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:51:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-24 13:51:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:51:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-12-24 13:51:05,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2018-12-24 13:51:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:05,361 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2018-12-24 13:51:05,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2018-12-24 13:51:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:05,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:05,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:05,362 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2018-12-24 13:51:05,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:05,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:05,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:05,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:05,573 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2018-12-24 13:51:05,577 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:05,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:05,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:05,584 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:05,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:05,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:05,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:05,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:05,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:05,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-24 13:51:05,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:05,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:05,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-24 13:51:05,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:05,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:05,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:05,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:05,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:06,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:06,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:06,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:06,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:06,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-24 13:51:06,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:06,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:06,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:06,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:06,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:06,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:06,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:06,227 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2018-12-24 13:51:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:06,360 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-24 13:51:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:06,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:06,363 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:51:06,363 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 13:51:06,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 13:51:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2018-12-24 13:51:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:51:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-24 13:51:06,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-24 13:51:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:06,368 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-24 13:51:06,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-24 13:51:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:06,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:06,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:06,369 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2018-12-24 13:51:06,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:06,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:06,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:06,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:06,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:06,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:06,428 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2018-12-24 13:51:06,430 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:06,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:06,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:06,438 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:06,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:06,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:06,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:06,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:06,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:06,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-24 13:51:06,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 13:51:06,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:06,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:06,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-24 13:51:06,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:06,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 13:51:06,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:06,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:51:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:06,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:06,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:06,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:06,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:06,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:06,576 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-24 13:51:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:06,705 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2018-12-24 13:51:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:06,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:51:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:06,706 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:06,706 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 13:51:06,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 13:51:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-24 13:51:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:51:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-24 13:51:06,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2018-12-24 13:51:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:06,713 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2018-12-24 13:51:06,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2018-12-24 13:51:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:06,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:06,714 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 13:51:06,714 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2018-12-24 13:51:06,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:51:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:51:06,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:06,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:51:06,814 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2018-12-24 13:51:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:06,836 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2018-12-24 13:51:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:06,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:51:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:06,837 INFO L225 Difference]: With dead ends: 11 [2018-12-24 13:51:06,837 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:51:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:51:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:51:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 13:51:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:51:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-24 13:51:06,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2018-12-24 13:51:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:06,843 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2018-12-24 13:51:06,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-24 13:51:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:06,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:06,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:06,844 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2018-12-24 13:51:06,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:06,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:07,120 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-12-24 13:51:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:07,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:07,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:07,175 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2018-12-24 13:51:07,177 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:07,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:07,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:07,182 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 3. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:07,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:07,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:07,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:07,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:07,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:07,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:07,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-24 13:51:07,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:07,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2018-12-24 13:51:07,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:07,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:07,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:07,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:07,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:07,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:07,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-24 13:51:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:07,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-24 13:51:07,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:07,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:51:07,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:51:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:07,507 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 9 states. [2018-12-24 13:51:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:07,605 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2018-12-24 13:51:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:07,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-24 13:51:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:07,606 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:07,607 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:51:07,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:51:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:51:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:51:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:51:07,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-12-24 13:51:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:07,609 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:51:07,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:51:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:51:07,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:51:07,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:51:07,909 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2018-12-24 13:51:07,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:07,913 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2018-12-24 13:51:07,913 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:07,913 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) (.cse1 (let ((.cse3 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1))) (.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (<= 1 .cse2) .cse3) (and .cse3 (= 0 .cse2)))))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (= 0 .cse0) .cse1))) [2018-12-24 13:51:07,913 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2018-12-24 13:51:07,913 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2018-12-24 13:51:07,914 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-24 13:51:07,926 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:51:07 BoogieIcfgContainer [2018-12-24 13:51:07,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:51:07,927 INFO L168 Benchmark]: Toolchain (without parser) took 5235.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.8 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -605.4 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:07,928 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:07,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:07,929 INFO L168 Benchmark]: Boogie Preprocessor took 23.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:07,929 INFO L168 Benchmark]: RCFGBuilder took 339.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:07,930 INFO L168 Benchmark]: TraceAbstraction took 4813.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -626.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:07,933 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 339.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4813.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -626.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (0 == #memory_int[p1 := #memory_int[p1] + 1][p2] && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 4.7s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 34 SDslu, 1 SDs, 0 SdLazy, 161 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 99 HoareAnnotationTreeSize, 1 FomulaSimplifications, 634 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 6 QuantifiedInterpolants, 1633 SizeOfPredicates, 5 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...