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_exp_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 16:43:04,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:43:04,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:43:04,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:43:04,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:43:04,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:43:04,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:43:04,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:43:04,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:43:04,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:43:04,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:43:04,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:43:04,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:43:04,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:43:04,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:43:04,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:43:04,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:43:04,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:43:04,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:43:04,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:43:04,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:43:04,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:43:04,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:43:04,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:43:04,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:43:04,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:43:04,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:43:04,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:43:04,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:43:04,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:43:04,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:43:04,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:43:04,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:43:04,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:43:04,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:43:04,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:43:04,774 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:43:04,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:43:04,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:43:04,804 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:43:04,805 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:43:04,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:43:04,805 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:43:04,805 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:43:04,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:43:04,806 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:43:04,807 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:43:04,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:43:04,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:43:04,807 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:43:04,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:43:04,809 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:43:04,809 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:43:04,809 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:43:04,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:43:04,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:43:04,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:43:04,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:43:04,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:43:04,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:43:04,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:43:04,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:43:04,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:43:04,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:43:04,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:43:04,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:43:04,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:43:04,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:43:04,812 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:43:04,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:43:04,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:43:04,813 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:43:04,813 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:43:04,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:43:04,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:43:04,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:43:04,873 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:43:04,873 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:43:04,874 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 16:43:04,874 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 16:43:04,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:43:04,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:43:04,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:04,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:43:04,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:43:04,957 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 04:43:04" (1/1) ... [2018-12-03 16:43:04,972 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 04:43:04" (1/1) ... [2018-12-03 16:43:04,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:43:04,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:43:04,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:43:04,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:43:05,006 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,006 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,009 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,009 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,024 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,032 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,037 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 04:43:04" (1/1) ... [2018-12-03 16:43:05,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:43:05,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:43:05,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:43:05,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:43:05,047 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 04:43:04" (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 16:43:05,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:43:05,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:43:05,778 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:43:05,780 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:43:05,780 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 04:43:05 BoogieIcfgContainer [2018-12-03 16:43:05,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:43:05,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:43:05,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:43:05,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:43:05,786 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 04:43:04" (1/2) ... [2018-12-03 16:43:05,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7b3a18 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 04:43:05, skipping insertion in model container [2018-12-03 16:43:05,787 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 04:43:05" (2/2) ... [2018-12-03 16:43:05,790 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 16:43:05,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:43:05,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:43:05,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:43:05,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:43:05,861 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:43:05,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:43:05,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:43:05,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:43:05,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:43:05,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:43:05,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:43:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 16:43:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:05,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:05,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:05,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:05,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 16:43:05,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:05,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:05,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:06,129 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 16:43:06,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:06,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:06,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:06,154 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 16:43:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:06,200 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 16:43:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:06,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:06,214 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:43:06,214 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:43:06,218 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 16:43:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:43:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 16:43:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:43:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 16:43:06,260 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 16:43:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:06,261 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 16:43:06,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 16:43:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:06,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:06,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:06,263 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:06,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 16:43:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:06,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:06,369 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 16:43:06,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:06,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:06,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:06,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:06,373 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 16:43:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:06,406 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 16:43:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:06,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:06,409 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:43:06,410 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:43:06,411 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 16:43:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:43:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 16:43:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:43:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 16:43:06,427 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 16:43:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:06,427 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 16:43:06,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 16:43:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:06,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:06,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:06,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:06,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 16:43:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:06,522 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 16:43:06,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:06,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:06,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:06,525 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 16:43:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:06,616 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 16:43:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:06,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:06,620 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:43:06,620 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:43:06,621 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 16:43:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:43:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 16:43:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:43:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 16:43:06,651 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 16:43:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:06,651 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 16:43:06,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 16:43:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:06,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:06,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:06,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:06,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 16:43:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:06,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:06,781 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 16:43:06,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:06,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:06,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:06,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:06,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:06,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:06,783 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 16:43:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:06,913 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 16:43:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:06,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:43:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:06,919 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:43:06,919 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:43:06,923 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 16:43:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:43:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 16:43:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:43:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 16:43:06,962 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 16:43:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:06,962 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 16:43:06,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 16:43:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:43:06,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:06,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:43:06,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:06,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:06,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 16:43:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:06,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:07,201 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 16:43:07,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:07,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:43:07,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:07,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:43:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:43:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:43:07,204 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 16:43:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:07,417 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 16:43:07,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:43:07,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 16:43:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:07,421 INFO L225 Difference]: With dead ends: 293 [2018-12-03 16:43:07,421 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:43:07,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:43:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:43:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 16:43:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:43:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 16:43:07,491 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 16:43:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:07,496 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 16:43:07,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:43:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 16:43:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:07,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:07,498 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 16:43:07,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:07,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 16:43:07,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:07,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:07,731 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:43:07,734 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 16:43:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:43:07,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:07,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:07,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:07,742 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 16:43:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:07,851 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 16:43:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:07,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 16:43:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:07,854 INFO L225 Difference]: With dead ends: 525 [2018-12-03 16:43:07,855 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:43:07,856 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 16:43:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:43:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 16:43:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 16:43:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 16:43:07,918 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 16:43:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:07,918 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 16:43:07,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 16:43:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:43:07,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:07,921 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 16:43:07,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:07,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 16:43:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:07,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:07,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:08,138 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 16:43:08,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:08,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:43:08,139 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 16:43:08,141 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 16:43:08,189 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:43:08,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:43:09,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:43:09,216 INFO L272 AbstractInterpreter]: Visited 22 different actions 105 times. Merged at 20 different actions 56 times. Widened at 3 different actions 3 times. Found 26 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 16:43:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:09,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:43:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:43:09,263 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 16:43:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:09,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:43:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:09,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:09,509 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 16:43:09,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:09,695 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 16:43:09,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:09,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 16:43:09,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:09,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:43:09,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:43:09,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:43:09,725 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 8 states. [2018-12-03 16:43:10,676 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:43:11,045 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:43:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:11,655 INFO L93 Difference]: Finished difference Result 767 states and 986 transitions. [2018-12-03 16:43:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:43:11,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-03 16:43:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:11,664 INFO L225 Difference]: With dead ends: 767 [2018-12-03 16:43:11,664 INFO L226 Difference]: Without dead ends: 272 [2018-12-03 16:43:11,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:43:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-03 16:43:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2018-12-03 16:43:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 16:43:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2018-12-03 16:43:11,730 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 28 [2018-12-03 16:43:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:11,730 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2018-12-03 16:43:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:43:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2018-12-03 16:43:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:43:11,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:11,739 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 16:43:11,740 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:11,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1903869193, now seen corresponding path program 2 times [2018-12-03 16:43:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:11,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:11,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:11,807 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 16:43:11,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:11,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:11,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:11,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:11,809 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand 3 states. [2018-12-03 16:43:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:11,819 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-12-03 16:43:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:11,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:43:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:11,820 INFO L225 Difference]: With dead ends: 251 [2018-12-03 16:43:11,820 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:11,821 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 16:43:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:11,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 16:43:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:11,822 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:11,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:11,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:11,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:13,015 WARN L180 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 16:43:13,252 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 16:43:13,362 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-12-03 16:43:13,575 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 16:43:13,695 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 16:43:13,994 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 16:43:14,133 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 16:43:14,273 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 16:43:14,388 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-12-03 16:43:14,392 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 16:43:14,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:14,392 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 16:43:14,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:14,393 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 16:43:14,393 INFO L444 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-12-03 16:43:14,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-12-03 16:43:14,393 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 16:43:14,393 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 16:43:14,393 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 16:43:14,394 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 16:43:14,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-12-03 16:43:14,394 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 16:43:14,394 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 16:43:14,394 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 16:43:14,395 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 16:43:14,395 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 16:43:14,395 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 16:43:14,419 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 04:43:14 BoogieIcfgContainer [2018-12-03 16:43:14,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:14,420 INFO L168 Benchmark]: Toolchain (without parser) took 9484.54 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 633.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -170.4 MB). Peak memory consumption was 463.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:14,421 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 16:43:14,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.53 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 16:43:14,422 INFO L168 Benchmark]: Boogie Preprocessor took 51.92 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 16:43:14,423 INFO L168 Benchmark]: RCFGBuilder took 735.24 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 16:43:14,424 INFO L168 Benchmark]: TraceAbstraction took 8637.59 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 633.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -202.1 MB). Peak memory consumption was 431.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:14,428 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.19 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 55.53 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 51.92 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 735.24 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 8637.59 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 633.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -202.1 MB). Peak memory consumption was 431.8 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, 8.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 2.6s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.7s 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, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 145 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 167 NumberOfFragments, 940 HoareAnnotationTreeSize, 14 FomulaSimplifications, 7437 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 375 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s 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...