java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:06:19,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:06:19,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:06:19,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:06:19,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:06:19,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:06:19,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:06:19,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:06:19,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:06:19,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:06:19,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:06:19,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:06:19,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:06:19,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:06:19,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:06:19,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:06:19,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:06:19,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:06:19,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:06:19,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:06:19,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:06:19,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:06:19,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:06:19,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:06:19,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:06:19,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:06:19,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:06:19,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:06:19,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:06:19,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:06:19,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:06:19,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:06:19,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:06:19,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:06:19,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:06:19,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:06:19,190 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:19,202 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:06:19,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:06:19,203 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:06:19,204 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:06:19,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:06:19,204 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:06:19,204 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:06:19,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:06:19,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:06:19,205 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:06:19,205 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:06:19,205 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:06:19,205 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:06:19,206 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:06:19,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:06:19,206 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:06:19,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:06:19,207 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:06:19,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:06:19,207 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:06:19,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:06:19,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:06:19,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:06:19,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:06:19,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:06:19,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:19,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:06:19,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:06:19,211 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:06:19,212 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:06:19,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:06:19,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:06:19,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:06:19,212 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:06:19,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:06:19,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:06:19,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:06:19,289 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:06:19,289 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:06:19,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-02-18 10:06:19,290 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-02-18 10:06:19,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:06:19,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:06:19,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:19,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:06:19,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:06:19,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:19,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:06:19,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:06:19,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:06:19,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/1) ... [2019-02-18 10:06:19,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:06:19,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:06:19,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:06:19,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:06:19,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (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:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:06:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:06:19,720 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:06:19,720 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-18 10:06:19,722 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:19 BoogieIcfgContainer [2019-02-18 10:06:19,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:06:19,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:06:19,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:06:19,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:06:19,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:19" (1/2) ... [2019-02-18 10:06:19,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435bda6 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:06:19, skipping insertion in model container [2019-02-18 10:06:19,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:19" (2/2) ... [2019-02-18 10:06:19,730 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-02-18 10:06:19,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:06:19,749 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-18 10:06:19,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-18 10:06:19,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:06:19,806 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:06:19,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:06:19,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:06:19,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:06:19,806 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:06:19,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:06:19,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:06:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-18 10:06:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:06:19,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:19,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:06:19,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-18 10:06:19,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:19,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:20,031 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:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:20,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:20,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:20,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:20,057 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-18 10:06:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:20,273 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-18 10:06:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:20,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:06:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:20,293 INFO L225 Difference]: With dead ends: 17 [2019-02-18 10:06:20,294 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 10:06:20,297 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:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 10:06:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-18 10:06:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 10:06:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-18 10:06:20,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-18 10:06:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:20,336 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-18 10:06:20,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-18 10:06:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:20,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:20,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:20,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-18 10:06:20,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:20,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:20,384 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:20,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:20,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:20,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:20,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:20,388 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-18 10:06:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:20,480 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 10:06:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:20,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:20,481 INFO L225 Difference]: With dead ends: 12 [2019-02-18 10:06:20,482 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 10:06:20,482 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:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 10:06:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-18 10:06:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 10:06:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-18 10:06:20,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-18 10:06:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:20,488 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-18 10:06:20,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-18 10:06:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:20,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:20,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:20,490 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-18 10:06:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:20,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:20,569 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:20,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:20,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:20,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:20,573 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-18 10:06:20,640 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:20,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:28,219 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:28,220 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:06:28,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:28,229 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:28,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:28,742 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:06:28,742 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:06:28,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:28,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:28,749 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 3 states. [2019-02-18 10:06:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:29,674 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-18 10:06:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:29,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:29,675 INFO L225 Difference]: With dead ends: 15 [2019-02-18 10:06:29,676 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 10:06:29,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 10:06:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-18 10:06:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 10:06:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-02-18 10:06:29,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 [2019-02-18 10:06:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:29,680 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-02-18 10:06:29,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2019-02-18 10:06:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:29,681 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:29,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:29,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-18 10:06:29,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:29,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:29,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:29,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:29,849 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-18 10:06:29,867 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:29,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:29,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:29,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:29,868 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-18 10:06:29,869 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:29,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:33,305 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:33,306 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:06:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:33,306 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:33,495 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:33,629 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:06:33,630 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:06:33,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:33,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:33,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:33,631 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2019-02-18 10:06:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:34,415 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2019-02-18 10:06:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:34,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:34,416 INFO L225 Difference]: With dead ends: 15 [2019-02-18 10:06:34,416 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 10:06:34,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 10:06:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-18 10:06:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-18 10:06:34,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-02-18 10:06:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:34,421 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-18 10:06:34,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-18 10:06:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:34,422 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:34,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:34,422 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash 30178, now seen corresponding path program 1 times [2019-02-18 10:06:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:34,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:34,522 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:34,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:34,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:34,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:34,523 INFO L207 CegarAbsIntRunner]: [0], [12], [15] [2019-02-18 10:06:34,525 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:34,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:37,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:37,952 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:06:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:37,953 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:38,129 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:38,215 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:06:38,216 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:38,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:38,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:06:38,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:38,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:38,217 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-02-18 10:06:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:38,743 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2019-02-18 10:06:38,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:38,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:38,744 INFO L225 Difference]: With dead ends: 16 [2019-02-18 10:06:38,745 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 10:06:38,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 10:06:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 10:06:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 10:06:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-02-18 10:06:38,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 3 [2019-02-18 10:06:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:38,751 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-02-18 10:06:38,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-02-18 10:06:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:06:38,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:38,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:06:38,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-18 10:06:38,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:38,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:38,960 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:38,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:38,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:38,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:06:38,962 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-18 10:06:38,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:38,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:49,721 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:49,721 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:49,722 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:50,198 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:50,397 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:06:50,398 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:50,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:50,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:06:50,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:50,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:50,400 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 3 states. [2019-02-18 10:06:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:51,375 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2019-02-18 10:06:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:51,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:06:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:51,376 INFO L225 Difference]: With dead ends: 17 [2019-02-18 10:06:51,376 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 10:06:51,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 10:06:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-02-18 10:06:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-18 10:06:51,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-02-18 10:06:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:51,383 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-18 10:06:51,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-18 10:06:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:06:51,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:51,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:06:51,384 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2019-02-18 10:06:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:51,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:51,552 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-02-18 10:06:51,589 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:51,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:51,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:51,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:06:51,591 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [15] [2019-02-18 10:06:51,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:51,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:01,860 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:01,861 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:01,861 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:02,196 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:02,311 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:07:02,312 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:02,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:07:02,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:02,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:02,313 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-02-18 10:07:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:02,907 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2019-02-18 10:07:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:02,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:07:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:02,908 INFO L225 Difference]: With dead ends: 17 [2019-02-18 10:07:02,908 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 10:07:02,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 10:07:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-02-18 10:07:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:07:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-18 10:07:02,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-02-18 10:07:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:02,915 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-02-18 10:07:02,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-02-18 10:07:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:02,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:02,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:02,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:02,916 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-18 10:07:02,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:02,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:02,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:03,126 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-02-18 10:07:03,318 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-02-18 10:07:03,327 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:07:03,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:03,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:03,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:03,328 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-18 10:07:03,329 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:03,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:13,838 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:13,838 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:13,839 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:14,106 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:14,234 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:07:14,234 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:14,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:14,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:07:14,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:14,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:14,236 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-02-18 10:07:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:14,865 INFO L93 Difference]: Finished difference Result 19 states and 35 transitions. [2019-02-18 10:07:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:14,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:07:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:14,866 INFO L225 Difference]: With dead ends: 19 [2019-02-18 10:07:14,866 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 10:07:14,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 10:07:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-18 10:07:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 10:07:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2019-02-18 10:07:14,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 4 [2019-02-18 10:07:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:14,877 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2019-02-18 10:07:14,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2019-02-18 10:07:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:14,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:14,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:14,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 28817894, now seen corresponding path program 1 times [2019-02-18 10:07:14,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:14,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:14,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:15,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:15,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:15,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:15,061 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-18 10:07:15,062 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:15,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:34,003 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:34,004 INFO L272 AbstractInterpreter]: Visited 5 different actions 57 times. Merged at 3 different actions 13 times. Widened at 3 different actions 9 times. Found 29 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:34,004 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:34,426 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:34,800 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-18 10:07:34,801 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:34,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:34,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2019-02-18 10:07:34,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:34,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:34,802 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 3 states. [2019-02-18 10:07:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:35,141 INFO L93 Difference]: Finished difference Result 14 states and 30 transitions. [2019-02-18 10:07:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:35,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-02-18 10:07:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:35,142 INFO L225 Difference]: With dead ends: 14 [2019-02-18 10:07:35,142 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 10:07:35,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 10:07:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 10:07:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 10:07:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2019-02-18 10:07:35,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 28 transitions. Word has length 5 [2019-02-18 10:07:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:35,156 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 28 transitions. [2019-02-18 10:07:35,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 28 transitions. [2019-02-18 10:07:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:35,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:35,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:35,157 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1924193896, now seen corresponding path program 1 times [2019-02-18 10:07:35,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:35,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:35,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:35,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:35,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:35,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:35,290 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [18], [19] [2019-02-18 10:07:35,290 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:35,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:16,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:08:16,159 INFO L272 AbstractInterpreter]: Visited 7 different actions 79 times. Merged at 4 different actions 27 times. Widened at 3 different actions 12 times. Found 48 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:08:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:16,159 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:08:17,416 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:08:17,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_610 Int) (v_idx_600 Int) (v_idx_603 Int) (v_idx_608 Int) (v_idx_606 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_600)) (< v_idx_600 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_600)) (or (< v_idx_603 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_603) (= 1 (select |c_#valid| v_idx_603))) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p2) (let ((.cse17 (select |c_#memory_int| v_idx_606)) (.cse15 (select |c_#memory_int| v_idx_608))) (let ((.cse6 (< v_idx_608 c_ULTIMATE.start_main_p2)) (.cse16 (<= .cse2 v_idx_608)) (.cse13 (<= (* 2 .cse15) 0)) (.cse8 (<= .cse15 .cse17)) (.cse14 (<= .cse15 0)) (.cse11 (< v_idx_606 c_ULTIMATE.start_main_p1)) (.cse12 (<= .cse3 v_idx_606)) (.cse9 (<= 0 .cse17)) (.cse10 (<= 0 (* 2 .cse17)))) (let ((.cse18 (let ((.cse19 (or .cse11 .cse12 (and .cse9 .cse10)))) (or (and .cse6 .cse19) (and .cse16 .cse19) (and .cse13 (or .cse11 .cse12 (and .cse8 .cse9 .cse10)) .cse14))))) (or (let ((.cse4 (select |c_#memory_int| v_idx_610))) (and (<= 0 (* 2 .cse4)) (<= 0 .cse4) (let ((.cse7 (<= 0 (+ .cse4 .cse17)))) (let ((.cse5 (or .cse11 (and .cse7 .cse9 .cse10) .cse12))) (or (and .cse5 .cse6) (and (or (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 .cse14 (<= .cse15 .cse4)) (and .cse5 .cse16)))))) (and .cse18 (< v_idx_610 c_ULTIMATE.start_malloc_ptr)) (and .cse18 (<= .cse1 v_idx_610)))))) (<= .cse2 c_ULTIMATE.start_main_p3)))) is different from false [2019-02-18 10:08:18,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_621 Int) (v_idx_623 Int) (v_idx_613 Int) (v_idx_619 Int) (v_idx_616 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 2)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 1))) (and (or (<= .cse0 v_idx_613) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_613)) (< v_idx_613 c_ULTIMATE.start_malloc_ptr)) (<= .cse1 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (let ((.cse15 (select |c_#memory_int| v_idx_621)) (.cse12 (select |c_#memory_int| v_idx_623))) (let ((.cse4 (<= .cse0 v_idx_623)) (.cse2 (< v_idx_623 c_ULTIMATE.start_malloc_ptr)) (.cse10 (<= .cse15 .cse12)) (.cse13 (<= 0 (* 2 .cse12))) (.cse14 (<= 0 .cse12)) (.cse5 (< v_idx_621 c_ULTIMATE.start_main_p2)) (.cse6 (<= .cse19 v_idx_621)) (.cse8 (<= .cse15 0)) (.cse9 (<= (* 2 .cse15) 0))) (let ((.cse16 (let ((.cse18 (or .cse5 .cse6 (and .cse8 .cse9)))) (or (and .cse4 .cse18) (and .cse2 .cse18) (and (or (and .cse8 .cse9 .cse10) .cse5 .cse6) .cse13 .cse14))))) (or (let ((.cse11 (select |c_#memory_int| v_idx_619))) (and (let ((.cse7 (<= .cse15 .cse11))) (let ((.cse3 (or .cse5 .cse6 (and .cse7 .cse8 .cse9)))) (or (and .cse2 .cse3) (and .cse3 .cse4) (and (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (<= 0 (+ .cse11 .cse12)) .cse13 .cse14)))) (<= 0 .cse11) (<= 0 (* 2 .cse11)))) (and .cse16 (< v_idx_619 c_ULTIMATE.start_main_p1)) (and (<= .cse17 v_idx_619) .cse16))))) (or (<= .cse0 v_idx_616) (= (select |c_#valid| v_idx_616) 1) (< v_idx_616 c_ULTIMATE.start_malloc_ptr)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_main_p2) (<= .cse19 c_ULTIMATE.start_main_p3)))) is different from false [2019-02-18 10:08:18,801 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-18 10:08:18,801 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:08:18,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:08:18,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-02-18 10:08:18,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:18,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:08:18,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:08:18,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=8, Unknown=2, NotChecked=10, Total=30 [2019-02-18 10:08:18,804 INFO L87 Difference]: Start difference. First operand 12 states and 28 transitions. Second operand 6 states. [2019-02-18 10:08:20,264 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_610 Int) (v_idx_600 Int) (v_idx_603 Int) (v_idx_608 Int) (v_idx_606 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_600)) (< v_idx_600 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_600)) (or (< v_idx_603 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_603) (= 1 (select |c_#valid| v_idx_603))) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p2) (let ((.cse17 (select |c_#memory_int| v_idx_606)) (.cse15 (select |c_#memory_int| v_idx_608))) (let ((.cse6 (< v_idx_608 c_ULTIMATE.start_main_p2)) (.cse16 (<= .cse2 v_idx_608)) (.cse13 (<= (* 2 .cse15) 0)) (.cse8 (<= .cse15 .cse17)) (.cse14 (<= .cse15 0)) (.cse11 (< v_idx_606 c_ULTIMATE.start_main_p1)) (.cse12 (<= .cse3 v_idx_606)) (.cse9 (<= 0 .cse17)) (.cse10 (<= 0 (* 2 .cse17)))) (let ((.cse18 (let ((.cse19 (or .cse11 .cse12 (and .cse9 .cse10)))) (or (and .cse6 .cse19) (and .cse16 .cse19) (and .cse13 (or .cse11 .cse12 (and .cse8 .cse9 .cse10)) .cse14))))) (or (let ((.cse4 (select |c_#memory_int| v_idx_610))) (and (<= 0 (* 2 .cse4)) (<= 0 .cse4) (let ((.cse7 (<= 0 (+ .cse4 .cse17)))) (let ((.cse5 (or .cse11 (and .cse7 .cse9 .cse10) .cse12))) (or (and .cse5 .cse6) (and (or (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 .cse14 (<= .cse15 .cse4)) (and .cse5 .cse16)))))) (and .cse18 (< v_idx_610 c_ULTIMATE.start_malloc_ptr)) (and .cse18 (<= .cse1 v_idx_610)))))) (<= .cse2 c_ULTIMATE.start_main_p3)))) (forall ((v_idx_621 Int) (v_idx_623 Int) (v_idx_613 Int) (v_idx_619 Int) (v_idx_616 Int)) (let ((.cse20 (+ c_ULTIMATE.start_main_p3 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 2)) (.cse37 (+ c_ULTIMATE.start_main_p1 1)) (.cse39 (+ c_ULTIMATE.start_main_p2 1))) (and (or (<= .cse20 v_idx_613) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_613)) (< v_idx_613 c_ULTIMATE.start_malloc_ptr)) (<= .cse21 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (let ((.cse35 (select |c_#memory_int| v_idx_621)) (.cse32 (select |c_#memory_int| v_idx_623))) (let ((.cse24 (<= .cse20 v_idx_623)) (.cse22 (< v_idx_623 c_ULTIMATE.start_malloc_ptr)) (.cse30 (<= .cse35 .cse32)) (.cse33 (<= 0 (* 2 .cse32))) (.cse34 (<= 0 .cse32)) (.cse25 (< v_idx_621 c_ULTIMATE.start_main_p2)) (.cse26 (<= .cse39 v_idx_621)) (.cse28 (<= .cse35 0)) (.cse29 (<= (* 2 .cse35) 0))) (let ((.cse36 (let ((.cse38 (or .cse25 .cse26 (and .cse28 .cse29)))) (or (and .cse24 .cse38) (and .cse22 .cse38) (and (or (and .cse28 .cse29 .cse30) .cse25 .cse26) .cse33 .cse34))))) (or (let ((.cse31 (select |c_#memory_int| v_idx_619))) (and (let ((.cse27 (<= .cse35 .cse31))) (let ((.cse23 (or .cse25 .cse26 (and .cse27 .cse28 .cse29)))) (or (and .cse22 .cse23) (and .cse23 .cse24) (and (or .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30)) (<= 0 (+ .cse31 .cse32)) .cse33 .cse34)))) (<= 0 .cse31) (<= 0 (* 2 .cse31)))) (and .cse36 (< v_idx_619 c_ULTIMATE.start_main_p1)) (and (<= .cse37 v_idx_619) .cse36))))) (or (<= .cse20 v_idx_616) (= (select |c_#valid| v_idx_616) 1) (< v_idx_616 c_ULTIMATE.start_malloc_ptr)) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= .cse39 c_ULTIMATE.start_malloc_ptr) (<= .cse37 c_ULTIMATE.start_main_p2) (<= .cse39 c_ULTIMATE.start_main_p3)))) (forall ((v_idx_642 Int) (v_idx_647 Int) (v_idx_645 Int) (v_idx_649 Int) (v_idx_639 Int)) (let ((.cse40 (+ c_ULTIMATE.start_main_p1 2)) (.cse43 (+ c_ULTIMATE.start_main_p1 1)) (.cse42 (+ c_ULTIMATE.start_main_p3 1)) (.cse41 (+ c_ULTIMATE.start_main_p2 1))) (and (<= .cse40 c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_647) 0) (<= .cse41 v_idx_647) (< v_idx_647 c_ULTIMATE.start_main_p2)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_649 c_ULTIMATE.start_malloc_ptr) (<= .cse42 v_idx_649) (= (select |c_#memory_int| v_idx_649) 0)) (or (= 0 (select |c_#memory_int| v_idx_645)) (< v_idx_645 c_ULTIMATE.start_main_p1) (<= .cse43 v_idx_645)) (<= .cse40 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_639 c_ULTIMATE.start_malloc_ptr) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_639)) (<= .cse42 v_idx_639)) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (<= .cse43 c_ULTIMATE.start_main_p2) (or (<= .cse42 v_idx_642) (< v_idx_642 c_ULTIMATE.start_malloc_ptr) (= 1 (select |c_#valid| v_idx_642))) (<= .cse41 c_ULTIMATE.start_main_p3))))) is different from false [2019-02-18 10:08:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:22,617 INFO L93 Difference]: Finished difference Result 12 states and 28 transitions. [2019-02-18 10:08:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:08:22,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-02-18 10:08:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:22,617 INFO L225 Difference]: With dead ends: 12 [2019-02-18 10:08:22,618 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 10:08:22,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=12, Invalid=9, Unknown=3, NotChecked=18, Total=42 [2019-02-18 10:08:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 10:08:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 10:08:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 10:08:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 10:08:22,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-18 10:08:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:22,619 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 10:08:22,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:08:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 10:08:22,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 10:08:22,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 10:08:22,897 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 53 [2019-02-18 10:08:22,899 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:08:22,900 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (forall ((v_idx_642 Int) (v_idx_647 Int) (v_idx_645 Int) (v_idx_649 Int) (v_idx_639 Int)) (let ((.cse0 (+ ULTIMATE.start_main_p1 2)) (.cse3 (+ ULTIMATE.start_main_p1 1)) (.cse2 (+ ULTIMATE.start_main_p3 1)) (.cse1 (+ ULTIMATE.start_main_p2 1))) (and (<= .cse0 ULTIMATE.start_main_p3) (or (= (select |#memory_int| v_idx_647) 0) (<= .cse1 v_idx_647) (< v_idx_647 ULTIMATE.start_main_p2)) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (or (< v_idx_649 ULTIMATE.start_malloc_ptr) (<= .cse2 v_idx_649) (= (select |#memory_int| v_idx_649) 0)) (or (= 0 (select |#memory_int| v_idx_645)) (< v_idx_645 ULTIMATE.start_main_p1) (<= .cse3 v_idx_645)) (<= .cse0 ULTIMATE.start_malloc_ptr) (or (< v_idx_639 ULTIMATE.start_malloc_ptr) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_639)) (<= .cse2 v_idx_639)) (<= .cse1 ULTIMATE.start_malloc_ptr) (<= .cse3 ULTIMATE.start_main_p2) (or (<= .cse2 v_idx_642) (< v_idx_642 ULTIMATE.start_malloc_ptr) (= 1 (select |#valid| v_idx_642))) (<= .cse1 ULTIMATE.start_main_p3)))) [2019-02-18 10:08:22,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:08:22,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-18 10:08:22,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-02-18 10:08:22,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-18 10:08:22,900 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-02-18 10:08:22,901 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-18 10:08:22,901 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-02-18 10:08:22,911 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 10:08:22 BoogieIcfgContainer [2019-02-18 10:08:22,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 10:08:22,912 INFO L168 Benchmark]: Toolchain (without parser) took 123590.83 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 109.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 429.8 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:22,913 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 10:08:22,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.67 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:22,915 INFO L168 Benchmark]: Boogie Preprocessor took 29.35 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.6 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:08:22,916 INFO L168 Benchmark]: RCFGBuilder took 310.63 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 95.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:22,916 INFO L168 Benchmark]: TraceAbstraction took 123188.86 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 95.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 416.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:22,921 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 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.67 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.35 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.63 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 95.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123188.86 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 95.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 416.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (forall v_idx_642 : int, v_idx_647 : int, v_idx_645 : int, v_idx_649 : int, v_idx_639 : int :: ((((((((((p1 + 2 <= p3 && ((#memory_int[v_idx_647] == 0 || p2 + 1 <= v_idx_647) || v_idx_647 < p2)) && ptr <= p3) && p3 <= ptr) && ((v_idx_649 < ptr || p3 + 1 <= v_idx_649) || #memory_int[v_idx_649] == 0)) && ((0 == #memory_int[v_idx_645] || v_idx_645 < p1) || p1 + 1 <= v_idx_645)) && p1 + 2 <= ptr) && ((v_idx_639 < ptr || 0 == old(malloc_old_#valid)[v_idx_639]) || p3 + 1 <= v_idx_639)) && p2 + 1 <= ptr) && p1 + 1 <= p2) && ((p3 + 1 <= v_idx_642 || v_idx_642 < ptr) || 1 == #valid[v_idx_642])) && p2 + 1 <= p3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 123.1s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 21 SDslu, 1 SDs, 0 SdLazy, 46 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 14 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 105.8s AbstIntTime, 8 AbstIntIterations, 8 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 103 HoareAnnotationTreeSize, 1 FomulaSimplifications, 16335 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1227 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 1/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...