java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:18:26,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:18:26,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:18:26,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:18:26,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:18:26,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:18:26,998 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:18:27,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:18:27,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:18:27,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:18:27,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:18:27,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:18:27,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:18:27,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:18:27,012 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:18:27,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:18:27,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:18:27,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:18:27,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:18:27,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:18:27,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:18:27,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:18:27,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:18:27,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:18:27,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:18:27,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:18:27,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:18:27,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:18:27,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:18:27,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:18:27,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:18:27,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:18:27,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:18:27,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:18:27,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:18:27,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:18:27,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:18:27,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:18:27,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:18:27,062 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:18:27,062 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:18:27,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:18:27,062 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:18:27,063 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:18:27,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:18:27,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:18:27,063 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:18:27,063 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:18:27,064 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:18:27,064 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:18:27,065 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:18:27,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:18:27,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:18:27,067 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:18:27,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:18:27,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:18:27,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:18:27,069 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:18:27,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:18:27,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:18:27,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:18:27,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:18:27,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:18:27,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:18:27,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:18:27,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:18:27,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:18:27,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:18:27,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:18:27,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:18:27,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:18:27,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:18:27,073 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:18:27,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:18:27,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:18:27,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:18:27,074 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:18:27,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:18:27,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:18:27,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:18:27,128 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:18:27,129 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:18:27,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl [2018-12-03 19:18:27,130 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl' [2018-12-03 19:18:27,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:18:27,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:18:27,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:27,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:18:27,235 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:18:27,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:27,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:18:27,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:18:27,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:18:27,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:18:27,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:18:27,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:18:27,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:18:27,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (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 19:18:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:18:27,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:18:28,173 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:18:28,173 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:18:28,174 INFO L202 PluginConnector]: Adding new model pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:28 BoogieIcfgContainer [2018-12-03 19:18:28,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:18:28,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:18:28,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:18:28,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:18:28,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/2) ... [2018-12-03 19:18:28,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e983647 and model type pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:18:28, skipping insertion in model container [2018-12-03 19:18:28,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:28" (2/2) ... [2018-12-03 19:18:28,183 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl [2018-12-03 19:18:28,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:18:28,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:18:28,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:18:28,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:18:28,256 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:18:28,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:18:28,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:18:28,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:18:28,257 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:18:28,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:18:28,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:18:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 19:18:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:28,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:28,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:28,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:28,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-12-03 19:18:28,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:28,546 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 19:18:28,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:28,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:28,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:28,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:28,569 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-12-03 19:18:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:28,646 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-12-03 19:18:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:28,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:28,669 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:18:28,669 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 19:18:28,679 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 19:18:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 19:18:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-03 19:18:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:18:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-12-03 19:18:28,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-12-03 19:18:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:28,729 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-12-03 19:18:28,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-12-03 19:18:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:28,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:28,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:28,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:28,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-12-03 19:18:28,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:28,913 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 19:18:28,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:28,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:28,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:28,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:28,917 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-12-03 19:18:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:28,978 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-12-03 19:18:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:28,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:28,987 INFO L225 Difference]: With dead ends: 109 [2018-12-03 19:18:28,987 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:18:28,992 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 19:18:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:18:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-03 19:18:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 19:18:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-12-03 19:18:29,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-12-03 19:18:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,028 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-12-03 19:18:29,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-12-03 19:18:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,033 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-12-03 19:18:29,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,125 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 19:18:29,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:29,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:29,128 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-12-03 19:18:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:29,197 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-12-03 19:18:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:29,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:29,202 INFO L225 Difference]: With dead ends: 211 [2018-12-03 19:18:29,203 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 19:18:29,204 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 19:18:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 19:18:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-12-03 19:18:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 19:18:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-12-03 19:18:29,245 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-12-03 19:18:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,246 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-12-03 19:18:29,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-12-03 19:18:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-12-03 19:18:29,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,370 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 19:18:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:29,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:29,372 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-12-03 19:18:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:29,518 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-12-03 19:18:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:29,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:29,522 INFO L225 Difference]: With dead ends: 349 [2018-12-03 19:18:29,522 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 19:18:29,523 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 19:18:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 19:18:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-12-03 19:18:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 19:18:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-12-03 19:18:29,562 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-12-03 19:18:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,563 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-12-03 19:18:29,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-12-03 19:18:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-12-03 19:18:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,879 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:18:29,881 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 19:18:29,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:18:29,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:18:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:18:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:18:29,883 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-12-03 19:18:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:30,066 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-12-03 19:18:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:18:30,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-03 19:18:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:30,069 INFO L225 Difference]: With dead ends: 377 [2018-12-03 19:18:30,069 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 19:18:30,070 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 19:18:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 19:18:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-12-03 19:18:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 19:18:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-12-03 19:18:30,126 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-12-03 19:18:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:30,126 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-12-03 19:18:30,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:18:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-12-03 19:18:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:30,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:30,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:30,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:30,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-12-03 19:18:30,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:30,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:30,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:30,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:30,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:30,340 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-12-03 19:18:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:30,478 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-12-03 19:18:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:30,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:30,483 INFO L225 Difference]: With dead ends: 669 [2018-12-03 19:18:30,483 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 19:18:30,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 19:18:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-12-03 19:18:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 19:18:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-12-03 19:18:30,570 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-12-03 19:18:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:30,573 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-12-03 19:18:30,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-12-03 19:18:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:30,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:30,577 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 19:18:30,579 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:30,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-12-03 19:18:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:30,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:30,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:30,738 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-12-03 19:18:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:30,941 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-12-03 19:18:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:30,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:30,947 INFO L225 Difference]: With dead ends: 1329 [2018-12-03 19:18:30,947 INFO L226 Difference]: Without dead ends: 887 [2018-12-03 19:18:30,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-03 19:18:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-12-03 19:18:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-03 19:18:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-12-03 19:18:31,110 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-12-03 19:18:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:31,111 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-12-03 19:18:31,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-12-03 19:18:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:31,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:31,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:31,115 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:31,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-12-03 19:18:31,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:31,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:31,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:31,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:31,416 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:18:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:31,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:31,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:31,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:31,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:31,423 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-12-03 19:18:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:31,808 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-12-03 19:18:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:31,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:31,818 INFO L225 Difference]: With dead ends: 2649 [2018-12-03 19:18:31,819 INFO L226 Difference]: Without dead ends: 1767 [2018-12-03 19:18:31,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-12-03 19:18:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-12-03 19:18:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-12-03 19:18:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-12-03 19:18:32,147 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-12-03 19:18:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:32,148 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-12-03 19:18:32,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-12-03 19:18:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:32,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:32,151 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:32,151 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:32,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-12-03 19:18:32,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:32,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:32,363 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 19:18:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:32,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:32,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:18:32,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-03 19:18:32,393 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [60], [62], [64], [68], [70], [72] [2018-12-03 19:18:32,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:18:32,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:18:34,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:21:42,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:21:42,918 INFO L272 AbstractInterpreter]: Visited 28 different actions 886 times. Merged at 26 different actions 620 times. Widened at 18 different actions 292 times. Found 246 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 19:21:42,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:42,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:21:42,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:42,934 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 19:21:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:42,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:43,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:21:43,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:21:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 19:21:43,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:43,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:21:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:21:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:21:43,791 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-12-03 19:21:44,009 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 19:21:44,544 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 19:21:45,085 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 19:21:45,398 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 19:21:46,137 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 19:21:47,339 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 19:21:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:49,070 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-12-03 19:21:49,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:21:49,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-03 19:21:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:49,079 INFO L225 Difference]: With dead ends: 4087 [2018-12-03 19:21:49,079 INFO L226 Difference]: Without dead ends: 1617 [2018-12-03 19:21:49,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:21:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-03 19:21:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-12-03 19:21:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-03 19:21:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-12-03 19:21:49,344 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-12-03 19:21:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-12-03 19:21:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:21:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-12-03 19:21:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 19:21:49,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:49,347 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 19:21:49,348 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:49,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-12-03 19:21:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:49,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:49,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 19:21:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:21:49,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:21:49,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:21:49,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:21:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:21:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:21:49,440 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-12-03 19:21:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:49,475 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-12-03 19:21:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:21:49,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-03 19:21:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:49,475 INFO L225 Difference]: With dead ends: 1464 [2018-12-03 19:21:49,476 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:21:49,477 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 19:21:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:21:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:21:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:21:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:21:49,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-03 19:21:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:49,479 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:21:49,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:21:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:21:49,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:21:49,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:21:49,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,754 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 58 [2018-12-03 19:21:49,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:49,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:50,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:21:51,144 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 19:21:51,372 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 19:21:52,031 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:21:52,429 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 19:21:52,571 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 19:21:52,857 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-03 19:21:53,211 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:21:53,456 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 19:21:53,799 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-03 19:21:54,040 INFO L444 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:21:54,040 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,041 INFO L444 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:21:54,041 INFO L444 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse8 (div ~mode4 256))) (let ((.cse7 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse9 (<= .cse8 0)) (.cse0 (<= ~send3 127)) (.cse10 (<= 1 ~mode4)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 (= ~mode4 (* 256 .cse8)) .cse4) (and .cse9 (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5)))) [2018-12-03 19:21:54,041 INFO L444 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-12-03 19:21:54,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:21:54,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:21:54,041 INFO L444 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ULTIMATE.start_check_~tmp~133) (<= ~send3 127) (<= 1 ~mode4) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:21:54,041 INFO L444 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse8 (div ~mode4 256))) (let ((.cse7 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse9 (<= .cse8 0)) (.cse0 (<= ~send3 127)) (.cse10 (<= 1 ~mode4)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and (<= 1 ULTIMATE.start_check_~tmp~133) .cse0 .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 (= ~mode4 (* 256 .cse8)) .cse4) (and .cse9 (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5)))) [2018-12-03 19:21:54,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:21:54,042 INFO L444 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= 1 ULTIMATE.start_check_~tmp~133) .cse1 .cse2 .cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse8 .cse6 .cse7) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse4 .cse5 .cse8 .cse6))) [2018-12-03 19:21:54,042 INFO L444 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,042 INFO L444 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 (<= ~r1 (* 256 (div ~r1 256))) .cse5 .cse6))) [2018-12-03 19:21:54,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-12-03 19:21:54,042 INFO L444 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 (<= ~r1 (* 256 (div ~r1 256))) .cse5 .cse6))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= 1 ULTIMATE.start_check_~tmp~133) .cse1 .cse2 .cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse8 .cse6 .cse7) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse4 .cse5 .cse8 .cse6))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= 1 ULTIMATE.start_check_~tmp~133) (<= ~send3 127) (<= 1 ~mode4) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,043 INFO L444 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:21:54,068 INFO L202 PluginConnector]: Adding new model pals_lcr.6.1.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:21:54 BoogieIcfgContainer [2018-12-03 19:21:54,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:21:54,070 INFO L168 Benchmark]: Toolchain (without parser) took 206837.03 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 619.8 MB. Max. memory is 7.1 GB. [2018-12-03 19:21:54,071 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:21:54,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:21:54,072 INFO L168 Benchmark]: Boogie Preprocessor took 56.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:21:54,073 INFO L168 Benchmark]: RCFGBuilder took 818.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-12-03 19:21:54,073 INFO L168 Benchmark]: TraceAbstraction took 205893.37 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 567.0 MB. Max. memory is 7.1 GB. [2018-12-03 19:21:54,077 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 818.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205893.37 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 567.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 480]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((((~mode4 / 256 <= 0 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((1 <= check_~tmp~133 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((((~mode4 / 256 <= 0 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((((1 <= check_~tmp~133 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && 1 <= check_~tmp~133) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 205.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 190.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1489 HoareAnnotationTreeSize, 18 FomulaSimplifications, 47422 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 369 ConstructedInterpolants, 12 QuantifiedInterpolants, 54384 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 172/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...