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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:53:55,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:53:55,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:53:55,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:53:55,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:53:55,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:53:55,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:53:55,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:53:55,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:53:55,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:53:55,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:53:55,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:53:55,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:53:55,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:53:55,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:53:55,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:53:55,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:53:55,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:53:55,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:53:55,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:53:55,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:53:55,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:53:55,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:53:55,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:53:55,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:53:55,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:53:55,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:53:55,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:53:55,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:53:55,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:53:55,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:53:55,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:53:55,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:53:55,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:53:55,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:53:55,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:53:55,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:53:55,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:53:55,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:53:55,247 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:53:55,247 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:53:55,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:53:55,248 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:53:55,248 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:53:55,248 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:53:55,248 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:53:55,249 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:53:55,249 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:53:55,249 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:53:55,249 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:53:55,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:53:55,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:53:55,250 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:53:55,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:53:55,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:53:55,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:53:55,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:53:55,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:53:55,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:53:55,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:53:55,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:53:55,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:53:55,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:53:55,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:53:55,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:53:55,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:53:55,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:53:55,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:53:55,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:53:55,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:53:55,255 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:53:55,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:53:55,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:53:55,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:53:55,325 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:53:55,326 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:53:55,327 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 17:53:55,327 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl' [2018-12-03 17:53:55,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:53:55,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:53:55,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:55,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:53:55,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:53:55,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:55,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:53:55,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:53:55,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:53:55,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... [2018-12-03 17:53:55,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:53:55,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:53:55,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:53:55,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:53:55,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:53:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:53:55,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:53:56,191 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:53:56,192 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:53:56,192 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:56 BoogieIcfgContainer [2018-12-03 17:53:56,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:53:56,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:53:56,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:53:56,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:53:56,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:55" (1/2) ... [2018-12-03 17:53:56,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ece261 and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:53:56, skipping insertion in model container [2018-12-03 17:53:56,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:56" (2/2) ... [2018-12-03 17:53:56,201 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 17:53:56,211 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:53:56,219 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:53:56,238 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:53:56,275 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:53:56,275 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:53:56,275 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:53:56,275 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:53:56,276 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:53:56,276 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:53:56,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:53:56,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:53:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:53:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:53:56,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:56,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:56,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:56,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:53:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:56,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:56,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:56,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:56,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:56,634 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 17:53:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:56,696 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 17:53:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:56,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:53:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:56,710 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:53:56,711 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:53:56,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:53:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 17:53:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:53:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 17:53:56,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 17:53:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:56,758 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 17:53:56,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 17:53:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:53:56,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:56,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:56,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:56,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 17:53:56,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:56,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:56,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:56,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:56,892 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 17:53:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:56,949 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 17:53:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:56,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:53:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:56,956 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:53:56,956 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:53:56,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:53:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 17:53:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:53:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 17:53:56,989 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 17:53:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:56,990 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 17:53:56,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 17:53:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:53:56,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:56,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:56,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:56,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 17:53:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:56,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:56,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:57,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:57,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:53:57,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:57,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:53:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:53:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:53:57,213 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 17:53:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:57,397 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 17:53:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:53:57,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:53:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:57,406 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:53:57,406 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:53:57,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:53:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:53:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 17:53:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:53:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 17:53:57,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 17:53:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:57,451 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 17:53:57,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:53:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 17:53:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:53:57,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:57,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:57,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:57,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 17:53:57,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:57,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:57,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:57,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:57,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:57,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:57,561 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 17:53:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:57,657 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 17:53:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:57,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:53:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:57,659 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:53:57,659 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:53:57,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:53:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:53:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:53:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 17:53:57,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 17:53:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:57,692 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 17:53:57,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 17:53:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:53:57,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:57,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:57,696 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:57,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:57,697 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 17:53:57,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:57,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:57,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:57,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:57,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:57,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:57,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:57,896 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 17:53:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:57,991 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 17:53:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:57,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:53:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:57,994 INFO L225 Difference]: With dead ends: 249 [2018-12-03 17:53:57,994 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:53:57,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:53:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 17:53:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:53:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 17:53:58,036 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 17:53:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:58,037 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 17:53:58,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 17:53:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:53:58,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:58,039 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:58,039 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:58,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 17:53:58,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:58,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:58,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:58,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:58,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:58,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:58,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:58,191 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 17:53:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:58,302 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 17:53:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:58,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:53:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:58,305 INFO L225 Difference]: With dead ends: 489 [2018-12-03 17:53:58,305 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 17:53:58,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 17:53:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 17:53:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 17:53:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 17:53:58,371 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 17:53:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:58,372 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 17:53:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 17:53:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:53:58,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:58,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:58,375 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:58,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 17:53:58,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:58,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:58,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:58,771 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 17:53:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:58,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:58,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:58,818 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:53:58,820 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:53:58,891 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:53:58,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:53:59,901 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:54:44,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:54:44,959 INFO L272 AbstractInterpreter]: Visited 20 different actions 377 times. Merged at 19 different actions 265 times. Widened at 17 different actions 156 times. Found 73 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:54:44,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:44,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:54:44,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:44,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:54:44,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:44,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:54:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:45,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:54:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:54:45,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:54:45,852 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 17:54:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:54:45,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:54:45,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 17:54:45,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:54:45,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:54:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:54:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:54:45,902 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 8 states. [2018-12-03 17:54:46,148 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:54:46,563 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:54:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:48,268 INFO L93 Difference]: Finished difference Result 767 states and 960 transitions. [2018-12-03 17:54:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:54:48,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 17:54:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:48,272 INFO L225 Difference]: With dead ends: 767 [2018-12-03 17:54:48,272 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 17:54:48,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:54:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 17:54:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 267. [2018-12-03 17:54:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 17:54:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 308 transitions. [2018-12-03 17:54:48,332 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 308 transitions. Word has length 26 [2018-12-03 17:54:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:48,332 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 308 transitions. [2018-12-03 17:54:48,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:54:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2018-12-03 17:54:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:54:48,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:48,335 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:54:48,335 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:48,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1932160773, now seen corresponding path program 2 times [2018-12-03 17:54:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:48,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 17:54:48,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:48,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:48,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:48,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:48,410 INFO L87 Difference]: Start difference. First operand 267 states and 308 transitions. Second operand 3 states. [2018-12-03 17:54:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:48,421 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2018-12-03 17:54:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:48,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:54:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:48,422 INFO L225 Difference]: With dead ends: 277 [2018-12-03 17:54:48,422 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:54:48,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:54:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:54:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:54:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:54:48,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 17:54:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:48,424 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:54:48,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:54:48,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:54:48,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:54:48,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:48,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:48,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:48,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:54:49,534 WARN L180 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 17:54:50,345 WARN L180 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:54:50,532 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 17:54:50,771 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-03 17:54:50,947 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:54:51,051 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 17:54:51,315 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-03 17:54:51,451 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 17:54:51,736 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-03 17:54:51,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:54:51,739 INFO L444 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-12-03 17:54:51,739 INFO L444 ceAbstractionStarter]: At program point L283(lines 283 293) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,740 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 383) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~102) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:54:51,740 INFO L444 ceAbstractionStarter]: At program point L341(lines 335 342) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,740 INFO L444 ceAbstractionStarter]: At program point L366(lines 361 367) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~102) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:54:51,740 INFO L444 ceAbstractionStarter]: At program point L298(lines 292 299) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,741 INFO L444 ceAbstractionStarter]: At program point L321(lines 312 322) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse5)) .cse3) (and .cse6 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 17:54:51,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:54:51,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:54:51,741 INFO L444 ceAbstractionStarter]: At program point L278(lines 272 279) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 17:54:51,741 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,742 INFO L444 ceAbstractionStarter]: At program point L262(lines 262 273) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,742 INFO L444 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse5)) .cse3) (and .cse6 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 17:54:51,742 INFO L444 ceAbstractionStarter]: At program point L388(lines 255 388) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:54:51,742 INFO L444 ceAbstractionStarter]: At program point L355(lines 355 362) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= ~r1 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:54:51,761 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:54:51 BoogieIcfgContainer [2018-12-03 17:54:51,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:54:51,763 INFO L168 Benchmark]: Toolchain (without parser) took 56350.00 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:54:51,764 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:54:51,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:54:51,765 INFO L168 Benchmark]: Boogie Preprocessor took 53.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:54:51,766 INFO L168 Benchmark]: RCFGBuilder took 669.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 17:54:51,767 INFO L168 Benchmark]: TraceAbstraction took 55568.06 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:54:51,771 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 669.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55568.06 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~102) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= check_~tmp~102) && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 55.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 171 SDslu, 181 SDs, 0 SdLazy, 168 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 88 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 171 NumberOfFragments, 700 HoareAnnotationTreeSize, 13 FomulaSimplifications, 6555 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 116 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 23490 SizeOfPredicates, 9 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 108/132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...