java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:41:25,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:41:25,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:41:25,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:41:25,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:41:25,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:41:25,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:41:25,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:41:25,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:41:25,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:41:25,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:41:25,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:41:25,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:41:25,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:41:25,988 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:41:25,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:41:25,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:41:25,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:41:25,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:41:26,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:41:26,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:41:26,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:41:26,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:41:26,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:41:26,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:41:26,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:41:26,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:41:26,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:41:26,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:41:26,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:41:26,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:41:26,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:41:26,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:41:26,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:41:26,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:41:26,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:41:26,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:41:26,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:41:26,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:41:26,050 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:41:26,050 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:41:26,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:41:26,050 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:41:26,050 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:41:26,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:41:26,052 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:41:26,053 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:41:26,053 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:41:26,053 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:41:26,053 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:41:26,053 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:41:26,054 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:41:26,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:41:26,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:41:26,055 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:41:26,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:41:26,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:41:26,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:41:26,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:41:26,057 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:41:26,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:41:26,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:41:26,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:41:26,058 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:41:26,058 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:41:26,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:41:26,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:41:26,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:41:26,059 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:41:26,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:26,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:41:26,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:41:26,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:41:26,061 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:41:26,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:41:26,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:41:26,061 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:41:26,061 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:41:26,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:41:26,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:41:26,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:41:26,138 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:41:26,138 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:41:26,139 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl [2018-12-03 16:41:26,139 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl' [2018-12-03 16:41:26,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:41:26,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:41:26,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:26,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:41:26,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:41:26,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:26,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:41:26,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:41:26,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:41:26,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... [2018-12-03 16:41:26,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:41:26,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:41:26,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:41:26,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:41:26,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:41:26,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:41:26,956 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:41:26,956 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:41:26,956 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:26 BoogieIcfgContainer [2018-12-03 16:41:26,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:41:26,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:41:26,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:41:26,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:41:26,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:26" (1/2) ... [2018-12-03 16:41:26,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c0a517 and model type pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:41:26, skipping insertion in model container [2018-12-03 16:41:26,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:26" (2/2) ... [2018-12-03 16:41:26,965 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl [2018-12-03 16:41:26,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:41:26,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:41:27,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:41:27,038 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:41:27,038 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:41:27,039 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:41:27,039 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:41:27,039 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:41:27,039 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:41:27,039 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:41:27,039 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:41:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-03 16:41:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:41:27,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:27,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:27,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:27,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-12-03 16:41:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:27,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:27,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:27,336 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-12-03 16:41:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:27,378 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-03 16:41:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:27,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 16:41:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:27,392 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:41:27,393 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:41:27,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:41:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-03 16:41:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:41:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-03 16:41:27,439 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-12-03 16:41:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:27,440 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-03 16:41:27,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-03 16:41:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:41:27,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:27,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:27,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:27,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-12-03 16:41:27,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:27,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:27,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:27,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:27,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:41:27,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:27,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:41:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:41:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:41:27,679 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-12-03 16:41:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:27,844 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-12-03 16:41:27,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:41:27,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-03 16:41:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:27,846 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:41:27,846 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:41:27,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:41:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:41:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-12-03 16:41:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:41:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-12-03 16:41:27,859 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-12-03 16:41:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:27,859 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-03 16:41:27,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:41:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-12-03 16:41:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:41:27,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:27,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:27,861 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:27,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-12-03 16:41:27,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:27,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:27,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:27,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:27,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:27,957 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-12-03 16:41:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:28,012 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-12-03 16:41:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:28,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 16:41:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:28,014 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:41:28,014 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:41:28,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:41:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 16:41:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:41:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-03 16:41:28,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-12-03 16:41:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:28,028 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-03 16:41:28,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-03 16:41:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:41:28,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:28,030 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:28,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:28,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-12-03 16:41:28,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:28,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:28,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:28,332 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:41:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:28,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:28,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:28,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:28,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:28,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:28,337 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-12-03 16:41:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:28,419 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-12-03 16:41:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:28,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 16:41:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:28,423 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:41:28,425 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:41:28,426 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 16:41:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:41:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 16:41:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:41:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-12-03 16:41:28,464 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-12-03 16:41:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:28,467 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-12-03 16:41:28,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-12-03 16:41:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:41:28,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:28,469 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:28,469 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:28,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-12-03 16:41:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:28,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:28,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:28,667 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-12-03 16:41:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:28,772 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-12-03 16:41:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:28,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 16:41:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:28,785 INFO L225 Difference]: With dead ends: 213 [2018-12-03 16:41:28,785 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:41:28,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:41:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-12-03 16:41:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:41:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-12-03 16:41:28,836 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-12-03 16:41:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:28,836 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-12-03 16:41:28,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-12-03 16:41:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:41:28,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:28,838 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:28,839 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:28,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-12-03 16:41:28,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:28,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:41:29,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:29,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:29,033 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 16:41:29,035 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42] [2018-12-03 16:41:29,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:41:29,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:41:30,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:41:30,097 INFO L272 AbstractInterpreter]: Visited 17 different actions 105 times. Merged at 16 different actions 67 times. Widened at 4 different actions 12 times. Found 21 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 16:41:30,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:30,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:41:30,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:30,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:30,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:30,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:30,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:41:30,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:30,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2018-12-03 16:41:30,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:30,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:41:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:41:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:41:30,526 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 6 states. [2018-12-03 16:41:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:30,743 INFO L93 Difference]: Finished difference Result 329 states and 414 transitions. [2018-12-03 16:41:30,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:41:30,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 16:41:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:30,747 INFO L225 Difference]: With dead ends: 329 [2018-12-03 16:41:30,747 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:41:30,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:41:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:41:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-12-03 16:41:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 16:41:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-12-03 16:41:30,820 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 22 [2018-12-03 16:41:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:30,820 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-12-03 16:41:30,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:41:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-12-03 16:41:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:41:30,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:30,825 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:41:30,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:30,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2052825223, now seen corresponding path program 2 times [2018-12-03 16:41:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:30,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:31,676 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-12-03 16:41:31,947 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-12-03 16:41:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:41:31,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:31,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:31,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:31,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:31,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:31,960 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:31,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:31,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:32,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:41:32,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:32,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 16:41:32,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 16:41:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:41:32,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:32,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:41:32,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:41:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:41:32,742 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 8 states. [2018-12-03 16:41:33,089 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-12-03 16:41:33,535 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-12-03 16:41:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:33,845 INFO L93 Difference]: Finished difference Result 417 states and 506 transitions. [2018-12-03 16:41:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:41:33,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-12-03 16:41:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:33,848 INFO L225 Difference]: With dead ends: 417 [2018-12-03 16:41:33,848 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:41:33,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:41:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:41:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2018-12-03 16:41:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:41:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-12-03 16:41:33,878 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 42 [2018-12-03 16:41:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:33,879 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-12-03 16:41:33,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:41:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-12-03 16:41:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:41:33,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:33,881 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:41:33,881 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash -537457785, now seen corresponding path program 3 times [2018-12-03 16:41:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:33,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:33,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 16:41:33,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:33,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:33,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:33,931 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 3 states. [2018-12-03 16:41:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:33,938 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-12-03 16:41:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:33,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 16:41:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:33,939 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:41:33,940 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:41:33,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:41:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:41:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:41:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:41:33,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-03 16:41:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:33,942 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:41:33,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:41:33,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:41:33,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:41:34,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:34,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:34,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:34,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:34,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:34,908 WARN L180 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 16:41:35,335 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 16:41:35,754 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 16:41:35,886 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 16:41:36,055 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 16:41:36,199 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-03 16:41:36,498 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 16:41:36,896 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 16:41:36,899 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 315) no Hoare annotation was computed. [2018-12-03 16:41:36,900 INFO L444 ceAbstractionStarter]: At program point L252(lines 252 261) the Hoare annotation is: (let ((.cse0 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= ~p1_new .cse7))))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= (+ ~nomsg 1) 0)) (.cse5 (<= (div ~mode2 256) 0))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:41:36,900 INFO L444 ceAbstractionStarter]: At program point L312(lines 201 312) the Hoare annotation is: (let ((.cse1 (<= ~send1 127)) (.cse2 (= (+ ~nomsg 1) 0)) (.cse0 (div ~mode2 256))) (or (and (<= 0 ~send1) (= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 .cse0)) .cse1 .cse2) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (= .cse3 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) .cse1 .cse2 (<= .cse0 0)))) [2018-12-03 16:41:36,900 INFO L444 ceAbstractionStarter]: At program point L279(lines 279 286) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ~mode2) (<= ~r1 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (= (+ ~nomsg 1) 0) (<= (div ~mode2 256) 0)) [2018-12-03 16:41:36,901 INFO L444 ceAbstractionStarter]: At program point L306(lines 306 313) the Hoare annotation is: false [2018-12-03 16:41:36,901 INFO L444 ceAbstractionStarter]: At program point L300(lines 300 307) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~77) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (= (+ ~nomsg 1) 0) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 16:41:36,901 INFO L444 ceAbstractionStarter]: At program point L267(lines 260 268) the Hoare annotation is: (let ((.cse0 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= ~p1_new .cse7))))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= (+ ~nomsg 1) 0)) (.cse5 (<= (div ~mode2 256) 0))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:41:36,901 INFO L444 ceAbstractionStarter]: At program point L232(lines 232 242) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse2 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse0 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (= .cse9 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse1 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= ~p1_new .cse8))))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (= (+ ~nomsg 1) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~r1 0) .cse1 .cse3 (= ~mode2 (* 256 .cse7)) .cse4 .cse5) (and .cse0 .cse1 (<= ~r1 1) .cse3 .cse4 .cse5)))) [2018-12-03 16:41:36,902 INFO L444 ceAbstractionStarter]: At program point L290(lines 285 291) the Hoare annotation is: (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (= .cse0 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~77) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (= (+ ~nomsg 1) 0) (<= (div ~mode2 256) 0)) [2018-12-03 16:41:36,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 314) no Hoare annotation was computed. [2018-12-03 16:41:36,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 315) no Hoare annotation was computed. [2018-12-03 16:41:36,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 315) no Hoare annotation was computed. [2018-12-03 16:41:36,902 INFO L444 ceAbstractionStarter]: At program point L247(lines 241 248) the Hoare annotation is: (let ((.cse0 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= ~p1_new .cse7))))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= (+ ~nomsg 1) 0)) (.cse5 (<= (div ~mode2 256) 0))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (= .cse6 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:41:36,903 INFO L444 ceAbstractionStarter]: At program point L208(lines 208 220) the Hoare annotation is: (let ((.cse1 (<= ~send1 127)) (.cse2 (= (+ ~nomsg 1) 0)) (.cse0 (div ~mode2 256))) (or (and (<= 0 ~send1) (= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 .cse0)) .cse1 .cse2) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (= .cse3 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) .cse1 .cse2 (<= .cse0 0)))) [2018-12-03 16:41:36,903 INFO L444 ceAbstractionStarter]: At program point L227(lines 219 228) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse2 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse0 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (= .cse9 ~p1_old) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse1 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= ~p1_new .cse8))))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (= (+ ~nomsg 1) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~r1 0) .cse1 .cse3 (= ~mode2 (* 256 .cse7)) .cse4 .cse5) (and .cse0 .cse1 (<= ~r1 1) .cse3 .cse4 .cse5)))) [2018-12-03 16:41:36,923 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:41:36 BoogieIcfgContainer [2018-12-03 16:41:36,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:41:36,925 INFO L168 Benchmark]: Toolchain (without parser) took 10724.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -306.9 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:41:36,926 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 16:41:36,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.03 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 16:41:36,927 INFO L168 Benchmark]: Boogie Preprocessor took 52.17 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 16:41:36,928 INFO L168 Benchmark]: RCFGBuilder took 654.65 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:41:36,928 INFO L168 Benchmark]: TraceAbstraction took 9966.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -338.6 MB). Peak memory consumption was 396.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:41:36,933 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 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 45.03 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 52.17 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 654.65 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9966.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -338.6 MB). Peak memory consumption was 396.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 314]: 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: 208]: Loop Invariant Derived loop invariant: (((((0 <= ~send1 && ~r1 == 0) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~nomsg + 1 == 0) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((0 <= ~send1 && ~r1 == 0) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~nomsg + 1 == 0) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && 1 <= check_~tmp~77) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 1 <= assert_~arg - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && 1 <= ~mode2) && 1 <= check_~tmp~77) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) || (((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0)) || (((((~r1 == 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~nomsg + 1 == 0)) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0) || (((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) && ~mode2 / 256 <= 0)) || (((((~r1 == 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~nomsg + 1 == 0)) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 % 256 == ~p1_old) && v_prenex_1 <= 127) && 0 <= v_prenex_1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && ~p1_new == v_prenex_1 % 256)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~nomsg + 1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 9.8s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 158 SDtfs, 134 SDslu, 157 SDs, 0 SdLazy, 92 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 87 NumberOfFragments, 1033 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4137 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 186 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 250 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 302 ConstructedInterpolants, 12 QuantifiedInterpolants, 80756 SizeOfPredicates, 11 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 212/290 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...