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.4.1.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:57:49,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:57:49,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:57:49,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:57:49,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:57:49,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:57:49,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:57:49,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:57:49,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:57:49,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:57:49,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:57:49,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:57:49,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:57:49,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:57:49,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:57:49,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:57:49,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:57:49,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:57:49,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:57:49,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:57:49,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:57:49,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:57:49,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:57:49,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:57:49,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:57:49,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:57:49,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:57:49,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:57:49,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:57:49,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:57:49,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:57:49,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:57:49,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:57:49,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:57:49,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:57:49,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:57:49,480 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:57:49,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:57:49,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:57:49,500 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:57:49,500 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:57:49,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:57:49,501 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:57:49,501 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:57:49,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:57:49,501 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:57:49,501 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:57:49,502 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:57:49,502 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:57:49,502 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:57:49,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:57:49,503 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:57:49,503 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:57:49,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:57:49,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:57:49,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:57:49,504 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:57:49,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:57:49,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:57:49,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:57:49,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:57:49,505 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:57:49,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:57:49,505 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:57:49,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:57:49,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:57:49,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:57:49,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:57:49,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:57:49,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:57:49,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:57:49,506 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:57:49,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:57:49,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:57:49,507 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:57:49,507 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:57:49,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:57:49,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:57:49,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:57:49,558 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:57:49,558 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:57:49,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 17:57:49,560 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl' [2018-12-03 17:57:49,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:57:49,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:57:49,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:57:49,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:57:49,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:57:49,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:57:49,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:57:49,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:57:49,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:57:49,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/1) ... [2018-12-03 17:57:49,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:57:49,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:57:49,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:57:49,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:57:49,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (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:57:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:57:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:57:50,408 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:57:50,409 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:57:50,409 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:57:50 BoogieIcfgContainer [2018-12-03 17:57:50,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:57:50,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:57:50,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:57:50,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:57:50,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:57:49" (1/2) ... [2018-12-03 17:57:50,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d52b153 and model type pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:57:50, skipping insertion in model container [2018-12-03 17:57:50,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:57:50" (2/2) ... [2018-12-03 17:57:50,418 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 17:57:50,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:57:50,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:57:50,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:57:50,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:57:50,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:57:50,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:57:50,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:57:50,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:57:50,503 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:57:50,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:57:50,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:57:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 17:57:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:57:50,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:50,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:50,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:50,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 17:57:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:50,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:50,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:50,788 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:57:50,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:50,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:50,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:50,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:50,813 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 17:57:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:50,869 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 17:57:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:50,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:57:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:50,884 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:57:50,884 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:57:50,889 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:57:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:57:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 17:57:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:57:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 17:57:50,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 17:57:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:50,936 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 17:57:50,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 17:57:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:57:50,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:50,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:50,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:50,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 17:57:50,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:50,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:51,097 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:57:51,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:51,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:51,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:51,101 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 17:57:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:51,161 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 17:57:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:51,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:57:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:51,163 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:57:51,164 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:57:51,165 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:57:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:57:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 17:57:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:57:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 17:57:51,184 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 17:57:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:51,185 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 17:57:51,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 17:57:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:57:51,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:51,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:51,187 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:51,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 17:57:51,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:51,377 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:57:51,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:51,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:51,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:51,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:51,380 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 17:57:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:51,449 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 17:57:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:51,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:57:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:51,459 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:57:51,460 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:57:51,461 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:57:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:57:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 17:57:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:57:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 17:57:51,515 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 17:57:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:51,517 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 17:57:51,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 17:57:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:57:51,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:51,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:51,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:51,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 17:57:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:51,664 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:57:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:51,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:51,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:51,667 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 17:57:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:51,801 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 17:57:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:51,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:57:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:51,804 INFO L225 Difference]: With dead ends: 269 [2018-12-03 17:57:51,804 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 17:57:51,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:57:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 17:57:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 17:57:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 17:57:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 17:57:51,835 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 17:57:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:51,836 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 17:57:51,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 17:57:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:57:51,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:51,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:51,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:51,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 17:57:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:51,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:52,043 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:57:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:57:52,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:52,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:57:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:57:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:57:52,046 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 17:57:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:52,216 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 17:57:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:57:52,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 17:57:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:52,220 INFO L225 Difference]: With dead ends: 293 [2018-12-03 17:57:52,220 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 17:57:52,221 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:57:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 17:57:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 17:57:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:57:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 17:57:52,299 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 17:57:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:52,299 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 17:57:52,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:57:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 17:57:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:57:52,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:52,302 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:57:52,302 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:52,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 17:57:52,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:52,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:52,601 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:57:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:52,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:57:52,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:52,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:52,607 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 17:57:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:52,714 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 17:57:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:52,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 17:57:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:52,718 INFO L225 Difference]: With dead ends: 525 [2018-12-03 17:57:52,718 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 17:57:52,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 17:57:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 17:57:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 17:57:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 17:57:52,803 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 17:57:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:52,804 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 17:57:52,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 17:57:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:57:52,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:52,807 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, 1, 1] [2018-12-03 17:57:52,808 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:52,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 17:57:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:52,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:52,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:53,287 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:57:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:53,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:57:53,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:57:53,466 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 17:57:53,471 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [44], [46], [48], [52], [54], [56] [2018-12-03 17:57:53,542 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:57:53,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:57:54,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:58:52,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:58:52,351 INFO L272 AbstractInterpreter]: Visited 22 different actions 505 times. Merged at 21 different actions 346 times. Widened at 19 different actions 226 times. Found 113 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 17:58:52,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:52,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:58:52,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:52,367 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:58:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:52,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:58:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:52,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:58:52,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:58:53,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:53,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 17:58:53,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:53,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:58:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:58:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:58:53,423 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 8 states. [2018-12-03 17:58:53,643 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:58:53,929 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:58:54,554 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 17:58:55,026 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 17:58:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:56,037 INFO L93 Difference]: Finished difference Result 767 states and 986 transitions. [2018-12-03 17:58:56,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:58:56,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-03 17:58:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:56,040 INFO L225 Difference]: With dead ends: 767 [2018-12-03 17:58:56,040 INFO L226 Difference]: Without dead ends: 272 [2018-12-03 17:58:56,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:58:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-03 17:58:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2018-12-03 17:58:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 17:58:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2018-12-03 17:58:56,087 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 28 [2018-12-03 17:58:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:56,088 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2018-12-03 17:58:56,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:58:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2018-12-03 17:58:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:58:56,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:56,090 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:58:56,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:56,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:56,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1903869193, now seen corresponding path program 2 times [2018-12-03 17:58:56,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:56,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:56,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 17:58:56,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:56,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:56,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:56,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:56,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:56,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:56,174 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand 3 states. [2018-12-03 17:58:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:56,183 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-12-03 17:58:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:56,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 17:58:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:56,184 INFO L225 Difference]: With dead ends: 251 [2018-12-03 17:58:56,184 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:58:56,185 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:58:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:58:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:58:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:58:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:58:56,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 17:58:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:56,186 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:58:56,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:58:56,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:58:56,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:58:57,626 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 17:58:57,819 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 17:58:58,111 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 17:58:58,435 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 17:58:58,542 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 17:58:58,654 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:58:58,757 INFO L444 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:58:58,757 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-12-03 17:58:58,757 INFO L444 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:58:58,757 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-12-03 17:58:58,758 INFO L444 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse5 .cse2 .cse3 .cse6 .cse4) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse7)) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))))))) [2018-12-03 17:58:58,758 INFO L444 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-12-03 17:58:58,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-12-03 17:58:58,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse5 .cse2 .cse3 .cse6 .cse4) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse7)) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))))))) [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~r1 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:58:58,759 INFO L444 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-12-03 17:58:58,760 INFO L444 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~r1 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:58:58,760 INFO L444 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-12-03 17:58:58,760 INFO L444 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 17:58:58,760 INFO L444 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:58:58,781 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:58:58 BoogieIcfgContainer [2018-12-03 17:58:58,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:58:58,782 INFO L168 Benchmark]: Toolchain (without parser) took 69134.63 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 562.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:58:58,784 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:58,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:58,785 INFO L168 Benchmark]: Boogie Preprocessor took 41.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:58:58,785 INFO L168 Benchmark]: RCFGBuilder took 673.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:58:58,786 INFO L168 Benchmark]: TraceAbstraction took 68369.93 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 531.2 MB. Max. memory is 7.1 GB. [2018-12-03 17:58:58,790 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.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 673.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68369.93 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 531.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~84) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~84) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 68.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 217 SDslu, 157 SDs, 0 SdLazy, 184 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 58.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 145 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 167 NumberOfFragments, 940 HoareAnnotationTreeSize, 14 FomulaSimplifications, 7437 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 375 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 22026 SizeOfPredicates, 8 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 110/130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...