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/s3_srvr_4.cil.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:44:19,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:44:19,167 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:44:19,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:44:19,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:44:19,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:44:19,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:44:19,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:44:19,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:44:19,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:44:19,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:44:19,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:44:19,189 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:44:19,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:44:19,191 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:44:19,192 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:44:19,193 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:44:19,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:44:19,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:44:19,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:44:19,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:44:19,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:44:19,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:44:19,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:44:19,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:44:19,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:44:19,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:44:19,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:44:19,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:44:19,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:44:19,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:44:19,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:44:19,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:44:19,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:44:19,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:44:19,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:44:19,212 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:44:19,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:44:19,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:44:19,239 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:44:19,239 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:44:19,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:44:19,240 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:44:19,240 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:44:19,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:44:19,241 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:44:19,241 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:44:19,241 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:44:19,241 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:44:19,241 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:44:19,242 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:44:19,242 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:44:19,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:44:19,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:44:19,244 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:44:19,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:44:19,244 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:44:19,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:44:19,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:44:19,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:44:19,245 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:44:19,245 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:44:19,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:44:19,247 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:44:19,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:44:19,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:44:19,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:44:19,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:44:19,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:44:19,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:44:19,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:44:19,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:44:19,249 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:44:19,249 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:44:19,249 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:44:19,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:44:19,250 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:44:19,250 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:44:19,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:44:19,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:44:19,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:44:19,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:44:19,329 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:44:19,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl [2018-12-03 16:44:19,331 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl' [2018-12-03 16:44:19,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:44:19,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:44:19,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:19,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:44:19,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:44:19,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:19,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:44:19,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:44:19,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:44:19,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/1) ... [2018-12-03 16:44:19,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:44:19,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:44:19,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:44:19,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:44:19,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (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:44:19,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:44:19,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:44:20,170 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:44:20,170 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:44:20,170 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:20 BoogieIcfgContainer [2018-12-03 16:44:20,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:44:20,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:44:20,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:44:20,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:44:20,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:19" (1/2) ... [2018-12-03 16:44:20,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c676c32 and model type s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:44:20, skipping insertion in model container [2018-12-03 16:44:20,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:20" (2/2) ... [2018-12-03 16:44:20,178 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c_14.bpl [2018-12-03 16:44:20,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:44:20,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:44:20,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:44:20,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:44:20,243 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:44:20,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:44:20,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:44:20,244 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:44:20,244 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:44:20,244 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:44:20,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:44:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-03 16:44:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:44:20,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:20,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:20,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:20,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 212045975, now seen corresponding path program 1 times [2018-12-03 16:44:20,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:20,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:20,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:20,496 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:44:20,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:20,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:44:20,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:20,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:20,518 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-03 16:44:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:20,619 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-03 16:44:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:20,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 16:44:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:20,633 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:44:20,633 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:44:20,637 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:44:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:44:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:44:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:44:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-03 16:44:20,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2018-12-03 16:44:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:20,673 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-03 16:44:20,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-12-03 16:44:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:44:20,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:20,674 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:20,675 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:20,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash -251001873, now seen corresponding path program 1 times [2018-12-03 16:44:20,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:20,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:20,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:20,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:20,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:20,790 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2018-12-03 16:44:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:20,942 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2018-12-03 16:44:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:20,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 16:44:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:20,944 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:44:20,944 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:44:20,946 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 16:44:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:44:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:44:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:44:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-12-03 16:44:20,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 11 [2018-12-03 16:44:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:20,961 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-03 16:44:20,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-12-03 16:44:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:44:20,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:20,962 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:20,962 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -129109843, now seen corresponding path program 1 times [2018-12-03 16:44:20,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:20,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:44:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:21,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:21,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:21,135 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 3 states. [2018-12-03 16:44:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:21,377 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-03 16:44:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:21,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 16:44:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:21,379 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:44:21,379 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:44:21,380 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 16:44:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:44:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:44:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:44:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-03 16:44:21,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2018-12-03 16:44:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-03 16:44:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-03 16:44:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:44:21,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:21,389 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:21,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:21,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash 817687483, now seen corresponding path program 1 times [2018-12-03 16:44:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:44:21,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:21,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:21,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:21,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:21,497 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2018-12-03 16:44:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:21,576 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-12-03 16:44:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:21,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 16:44:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:21,578 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:44:21,579 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:44:21,579 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 16:44:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:44:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 16:44:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:44:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-12-03 16:44:21,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2018-12-03 16:44:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:21,589 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-12-03 16:44:21,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-12-03 16:44:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:44:21,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:21,590 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:21,590 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:21,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash 424660473, now seen corresponding path program 1 times [2018-12-03 16:44:21,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:44:21,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:21,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:21,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:21,712 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 3 states. [2018-12-03 16:44:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:21,789 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-12-03 16:44:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:21,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 16:44:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:21,791 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:44:21,791 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:44:21,791 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 16:44:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:44:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:44:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:44:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-12-03 16:44:21,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 23 [2018-12-03 16:44:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:21,801 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-12-03 16:44:21,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-12-03 16:44:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:44:21,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:21,802 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:21,803 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:21,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash 944888583, now seen corresponding path program 1 times [2018-12-03 16:44:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:21,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:44:21,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:21,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:21,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:21,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:21,898 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-12-03 16:44:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:21,990 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-12-03 16:44:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:21,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 16:44:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:21,992 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:44:21,992 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:44:21,993 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 16:44:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:44:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:44:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:44:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-03 16:44:22,003 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2018-12-03 16:44:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:22,004 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-03 16:44:22,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-03 16:44:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:44:22,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:22,006 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:22,006 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:22,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -680849109, now seen corresponding path program 1 times [2018-12-03 16:44:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:22,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:22,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:44:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:44:22,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:22,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:22,102 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 3 states. [2018-12-03 16:44:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:22,347 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2018-12-03 16:44:22,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:22,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 16:44:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:22,350 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:44:22,351 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:44:22,351 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 16:44:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:44:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:44:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:44:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-03 16:44:22,368 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 38 [2018-12-03 16:44:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:22,369 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-03 16:44:22,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-03 16:44:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:44:22,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:22,370 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:44:22,373 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:22,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash -625573959, now seen corresponding path program 1 times [2018-12-03 16:44:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:22,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:44:22,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:22,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:22,503 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 16:44:22,508 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [42], [44] [2018-12-03 16:44:22,549 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:44:22,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:44:23,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:44:23,357 INFO L272 AbstractInterpreter]: Visited 17 different actions 50 times. Merged at 15 different actions 25 times. Never widened. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 16:44:23,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:23,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:44:23,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:23,417 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:44:23,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:23,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:23,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:44:23,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:44:23,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:23,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 16:44:23,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:23,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:44:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:44:23,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:44:23,728 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-12-03 16:44:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:23,925 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-12-03 16:44:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:44:23,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 16:44:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:23,926 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:44:23,926 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:44:23,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:44:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:44:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:44:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:44:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:44:23,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-12-03 16:44:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:23,928 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:44:23,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:44:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:44:23,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:44:23,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:44:24,156 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2018-12-03 16:44:24,270 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-12-03 16:44:24,627 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2018-12-03 16:44:24,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 391) no Hoare annotation was computed. [2018-12-03 16:44:24,856 INFO L444 ceAbstractionStarter]: At program point L349(lines 349 364) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-12-03 16:44:24,856 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 389) the Hoare annotation is: false [2018-12-03 16:44:24,856 INFO L444 ceAbstractionStarter]: At program point L339(lines 339 350) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,856 INFO L444 ceAbstractionStarter]: At program point L368(lines 363 383) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-12-03 16:44:24,857 INFO L444 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,857 INFO L444 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 391) no Hoare annotation was computed. [2018-12-03 16:44:24,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 391) no Hoare annotation was computed. [2018-12-03 16:44:24,857 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 16:44:24,857 INFO L444 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,857 INFO L444 ceAbstractionStarter]: At program point L357(lines 357 375) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-12-03 16:44:24,858 INFO L444 ceAbstractionStarter]: At program point L388(lines 286 388) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,858 INFO L444 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-12-03 16:44:24,870 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:44:24 BoogieIcfgContainer [2018-12-03 16:44:24,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:44:24,875 INFO L168 Benchmark]: Toolchain (without parser) took 5450.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 709.4 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -574.2 MB). Peak memory consumption was 135.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:44:24,881 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:44:24,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.70 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:44:24,882 INFO L168 Benchmark]: Boogie Preprocessor took 33.88 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:44:24,882 INFO L168 Benchmark]: RCFGBuilder took 669.07 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:44:24,883 INFO L168 Benchmark]: TraceAbstraction took 4703.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -605.9 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:44:24,892 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.70 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 33.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 669.07 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 4703.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -605.9 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 15 SDslu, 52 SDs, 0 SdLazy, 119 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 61 NumberOfFragments, 214 HoareAnnotationTreeSize, 10 FomulaSimplifications, 304 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 13312 SizeOfPredicates, 2 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 413/428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...