java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:06:05,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:06:05,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:06:05,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:06:05,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:06:05,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:06:05,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:06:05,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:06:05,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:06:05,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:06:05,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:06:05,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:06:05,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:06:05,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:06:05,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:06:05,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:06:05,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:06:05,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:06:05,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:06:05,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:06:05,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:06:05,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:06:05,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:06:05,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:06:05,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:06:05,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:06:05,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:06:05,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:06:05,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:06:05,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:06:05,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:06:05,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:06:05,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:06:05,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:06:05,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:06:05,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:06:05,071 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 10:06:05,083 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:06:05,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:06:05,085 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:06:05,085 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:06:05,085 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:06:05,085 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:06:05,085 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:06:05,086 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:06:05,086 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:06:05,086 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:06:05,086 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:06:05,086 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:06:05,087 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:06:05,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:06:05,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:06:05,088 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:06:05,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:06:05,088 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:06:05,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:06:05,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:06:05,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:06:05,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:06:05,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:06:05,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:06:05,089 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:06:05,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:06:05,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:06:05,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:06:05,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:06:05,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:06:05,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:05,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:06:05,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:06:05,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:06:05,091 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:06:05,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:06:05,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:06:05,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:06:05,092 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:06:05,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:06:05,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:06:05,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:06:05,137 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:06:05,137 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:06:05,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-02-18 10:06:05,138 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-18 10:06:05,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:06:05,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:06:05,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:05,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:06:05,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:06:05,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:05,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:06:05,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:06:05,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:06:05,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... [2019-02-18 10:06:05,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:06:05,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:06:05,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:06:05,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:06:05,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:06:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:06:05,532 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:06:05,532 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-18 10:06:05,533 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:05 BoogieIcfgContainer [2019-02-18 10:06:05,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:06:05,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:06:05,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:06:05,538 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:06:05,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:05" (1/2) ... [2019-02-18 10:06:05,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c68ea1 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:06:05, skipping insertion in model container [2019-02-18 10:06:05,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:05" (2/2) ... [2019-02-18 10:06:05,542 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-18 10:06:05,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:06:05,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-18 10:06:05,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-18 10:06:05,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:06:05,606 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:06:05,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:06:05,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:06:05,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:06:05,607 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:06:05,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:06:05,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:06:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-18 10:06:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:06:05,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:05,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:06:05,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-18 10:06:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:05,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:05,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:05,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:05,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:05,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:05,805 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-18 10:06:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:05,952 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-18 10:06:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:05,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:06:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:05,970 INFO L225 Difference]: With dead ends: 13 [2019-02-18 10:06:05,970 INFO L226 Difference]: Without dead ends: 8 [2019-02-18 10:06:05,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-18 10:06:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-18 10:06:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 10:06:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-18 10:06:06,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-18 10:06:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:06,011 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-18 10:06:06,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-18 10:06:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:06,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:06,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:06,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-18 10:06:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:06,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:06,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:06,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:06,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:06,105 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-18 10:06:06,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:06,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:07,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:07,129 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:07,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:07,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:07,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:07,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:07,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:07,294 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 [2019-02-18 10:06:07,311 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 [2019-02-18 10:06:07,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:07,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:07,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:07,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-18 10:06:07,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:07,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 10:06:07,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:07,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:07,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 10:06:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:07,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:06:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-18 10:06:07,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:07,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:06:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:06:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-18 10:06:07,502 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-18 10:06:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:07,574 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-18 10:06:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:06:07,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 10:06:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:07,576 INFO L225 Difference]: With dead ends: 10 [2019-02-18 10:06:07,577 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 10:06:07,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-18 10:06:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 10:06:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-18 10:06:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 10:06:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-18 10:06:07,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-18 10:06:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:07,582 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-18 10:06:07,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:06:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-18 10:06:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:07,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:07,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:07,583 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-18 10:06:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:07,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:07,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:07,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:07,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:07,690 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-18 10:06:07,694 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:07,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:10,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:10,734 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:10,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:10,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:10,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:10,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:10,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:10,894 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-02-18 10:06:10,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-18 10:06:10,933 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 [2019-02-18 10:06:10,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:11,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:11,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 10:06:11,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:11,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:11,267 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-18 10:06:11,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:11,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:06:11,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:11,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:11,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-18 10:06:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:11,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:11,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:06:11,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:11,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:06:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:06:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:06:11,554 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-18 10:06:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:11,803 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-18 10:06:11,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:06:11,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 10:06:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:11,805 INFO L225 Difference]: With dead ends: 17 [2019-02-18 10:06:11,805 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 10:06:11,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:06:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 10:06:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-18 10:06:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-18 10:06:11,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-18 10:06:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:11,810 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-18 10:06:11,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:06:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-18 10:06:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:06:11,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:11,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:06:11,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-18 10:06:11,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:11,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:11,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:11,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:06:11,898 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-18 10:06:11,900 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:11,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:12,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:12,259 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:06:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:12,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:12,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:12,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:12,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:12,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:12,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:12,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 10:06:12,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-18 10:06:12,343 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 [2019-02-18 10:06:12,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,362 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-18 10:06:12,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:12,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 10:06:12,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 10:06:12,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:12,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:12,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:12,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:12,452 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 [2019-02-18 10:06:12,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:12,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:12,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-18 10:06:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:12,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:06:12,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:12,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:06:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:06:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:06:12,914 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-18 10:06:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:13,075 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-18 10:06:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:06:13,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:06:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:13,076 INFO L225 Difference]: With dead ends: 18 [2019-02-18 10:06:13,076 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 10:06:13,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:06:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 10:06:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-18 10:06:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 10:06:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-18 10:06:13,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-18 10:06:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:13,081 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-18 10:06:13,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:06:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-18 10:06:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:06:13,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:13,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:06:13,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-18 10:06:13,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:13,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:13,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:13,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:13,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:06:13,111 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-18 10:06:13,112 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:13,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:15,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:15,312 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:15,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:15,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:15,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:15,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:15,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:15,361 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 [2019-02-18 10:06:15,399 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 [2019-02-18 10:06:15,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:15,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:15,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:15,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-18 10:06:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:15,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 10:06:15,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:15,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:15,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 10:06:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:15,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:15,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:06:15,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 10:06:15,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:06:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:06:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:06:15,495 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-18 10:06:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:15,548 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-18 10:06:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:06:15,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:06:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:15,549 INFO L225 Difference]: With dead ends: 12 [2019-02-18 10:06:15,549 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 10:06:15,549 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 [2019-02-18 10:06:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 10:06:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-18 10:06:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 10:06:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-18 10:06:15,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-18 10:06:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-18 10:06:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:06:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-18 10:06:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:06:15,554 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:15,555 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 10:06:15,555 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-18 10:06:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:15,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:06:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:15,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 10:06:15,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:15,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:06:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:06:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:06:15,659 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-18 10:06:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:15,706 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-18 10:06:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:15,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 10:06:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:15,707 INFO L225 Difference]: With dead ends: 11 [2019-02-18 10:06:15,708 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 10:06:15,708 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 [2019-02-18 10:06:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 10:06:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 10:06:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 10:06:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-18 10:06:15,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-18 10:06:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:15,713 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-18 10:06:15,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:06:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-18 10:06:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:06:15,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:15,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:06:15,714 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-18 10:06:15,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:15,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:15,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:15,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:15,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:15,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:06:15,788 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-18 10:06:15,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:15,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:16,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:16,094 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:06:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:16,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:16,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:16,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:16,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:16,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:16,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 10:06:16,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-02-18 10:06:16,149 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 [2019-02-18 10:06:16,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-18 10:06:16,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:16,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:06:16,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 10:06:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:16,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:16,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:16,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 10:06:16,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:16,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:16,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-18 10:06:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:16,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:16,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:06:16,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:16,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:06:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:06:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:06:16,338 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-18 10:06:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:16,419 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-18 10:06:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:06:16,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:06:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:16,421 INFO L225 Difference]: With dead ends: 12 [2019-02-18 10:06:16,421 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 10:06:16,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:06:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 10:06:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 10:06:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 10:06:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 10:06:16,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-18 10:06:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:16,422 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 10:06:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:06:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 10:06:16,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 10:06:16,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 10:06:16,720 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-18 10:06:16,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:06:16,723 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-18 10:06:16,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:06:16,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-18 10:06:16,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-18 10:06:16,724 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2019-02-18 10:06:16,724 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-18 10:06:16,733 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 10:06:16 BoogieIcfgContainer [2019-02-18 10:06:16,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 10:06:16,733 INFO L168 Benchmark]: Toolchain (without parser) took 11556.01 ms. Allocated memory was 137.9 MB in the beginning and 517.5 MB in the end (delta: 379.6 MB). Free memory was 108.5 MB in the beginning and 279.1 MB in the end (delta: -170.6 MB). Peak memory consumption was 209.0 MB. Max. memory is 7.1 GB. [2019-02-18 10:06:16,734 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 10:06:16,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.30 ms. Allocated memory is still 137.9 MB. Free memory was 108.1 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-18 10:06:16,736 INFO L168 Benchmark]: Boogie Preprocessor took 20.40 ms. Allocated memory is still 137.9 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 10:06:16,736 INFO L168 Benchmark]: RCFGBuilder took 274.42 ms. Allocated memory is still 137.9 MB. Free memory was 105.0 MB in the beginning and 95.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-02-18 10:06:16,737 INFO L168 Benchmark]: TraceAbstraction took 11198.14 ms. Allocated memory was 137.9 MB in the beginning and 517.5 MB in the end (delta: 379.6 MB). Free memory was 95.2 MB in the beginning and 279.1 MB in the end (delta: -183.9 MB). Peak memory consumption was 195.7 MB. Max. memory is 7.1 GB. [2019-02-18 10:06:16,741 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.20 ms. Allocated memory is still 137.9 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.30 ms. Allocated memory is still 137.9 MB. Free memory was 108.1 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.40 ms. Allocated memory is still 137.9 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.42 ms. Allocated memory is still 137.9 MB. Free memory was 105.0 MB in the beginning and 95.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11198.14 ms. Allocated memory was 137.9 MB in the beginning and 517.5 MB in the end (delta: 379.6 MB). Free memory was 95.2 MB in the beginning and 279.1 MB in the end (delta: -183.9 MB). Peak memory consumption was 195.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: 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: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 11.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 1 SDs, 0 SdLazy, 175 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s 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, 6.9s 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, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 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...