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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:08,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:08,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:08,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:08,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:08,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:08,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:08,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:08,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:08,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:08,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:08,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:08,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:08,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:08,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:08,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:08,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:08,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:08,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:08,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:08,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:08,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:08,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:08,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:08,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:08,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:08,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:08,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:08,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:08,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:08,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:08,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:08,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:08,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:08,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:08,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:08,070 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:08,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:08,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:08,092 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:08,092 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:08,092 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:08,092 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:08,092 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:08,093 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:08,093 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:08,093 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:08,093 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:08,093 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:08,094 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:08,094 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:08,094 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:08,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:08,095 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:08,095 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:08,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:08,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:08,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:08,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:08,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:08,096 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:08,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:08,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:08,097 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:08,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:08,097 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:08,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:08,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:08,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:08,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:08,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:08,098 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:08,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:08,099 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:08,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:08,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:08,099 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:08,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:08,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:08,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:08,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:08,153 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:08,154 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:08,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2018-12-03 15:41:08,155 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2018-12-03 15:41:08,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:08,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:08,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:08,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:08,233 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:08,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:08,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:08,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:08,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:08,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/1) ... [2018-12-03 15:41:08,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:08,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:08,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:08,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:08,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (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 15:41:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:08,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:09,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:09,277 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:09,278 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:09 BoogieIcfgContainer [2018-12-03 15:41:09,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:09,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:09,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:09,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:09,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:08" (1/2) ... [2018-12-03 15:41:09,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692cdd12 and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:09, skipping insertion in model container [2018-12-03 15:41:09,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:09" (2/2) ... [2018-12-03 15:41:09,286 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2018-12-03 15:41:09,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:09,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:09,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:09,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:09,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:09,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:09,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:09,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:09,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:09,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:09,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 15:41:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:41:09,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2018-12-03 15:41:09,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:09,611 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 15:41:09,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:09,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:09,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:09,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,636 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-12-03 15:41:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:10,023 INFO L93 Difference]: Finished difference Result 51 states and 85 transitions. [2018-12-03 15:41:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:10,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:41:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:10,039 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:41:10,039 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:41:10,043 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 15:41:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:41:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:41:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:41:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2018-12-03 15:41:10,085 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 10 [2018-12-03 15:41:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:10,086 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2018-12-03 15:41:10,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2018-12-03 15:41:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:41:10,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:10,088 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:10,088 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:10,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -469243037, now seen corresponding path program 1 times [2018-12-03 15:41:10,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:10,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:10,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:10,204 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 3 states. [2018-12-03 15:41:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:10,534 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-12-03 15:41:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:10,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 15:41:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:10,542 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:41:10,542 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:41:10,545 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 15:41:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:41:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:41:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:41:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-12-03 15:41:10,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2018-12-03 15:41:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:10,564 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2018-12-03 15:41:10,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-12-03 15:41:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:41:10,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:10,566 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:10,568 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:10,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -215353290, now seen corresponding path program 1 times [2018-12-03 15:41:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:10,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:10,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:10,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:10,692 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2018-12-03 15:41:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:11,039 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2018-12-03 15:41:11,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:11,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:41:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:11,041 INFO L225 Difference]: With dead ends: 100 [2018-12-03 15:41:11,041 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:41:11,044 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 15:41:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:41:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:41:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:41:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2018-12-03 15:41:11,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 22 [2018-12-03 15:41:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:11,060 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-12-03 15:41:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2018-12-03 15:41:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:41:11,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:11,062 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:11,062 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:11,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1101636687, now seen corresponding path program 1 times [2018-12-03 15:41:11,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:41:11,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:11,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:11,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:11,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:11,179 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand 3 states. [2018-12-03 15:41:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:11,390 INFO L93 Difference]: Finished difference Result 119 states and 191 transitions. [2018-12-03 15:41:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:11,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-03 15:41:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:11,392 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:41:11,392 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:41:11,393 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 15:41:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:41:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:41:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:41:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2018-12-03 15:41:11,408 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 27 [2018-12-03 15:41:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:11,408 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2018-12-03 15:41:11,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2018-12-03 15:41:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:41:11,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:11,410 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:11,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:11,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874841, now seen corresponding path program 1 times [2018-12-03 15:41:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:41:11,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:11,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:11,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:11,498 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand 3 states. [2018-12-03 15:41:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:11,778 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2018-12-03 15:41:11,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:11,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:41:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:11,781 INFO L225 Difference]: With dead ends: 130 [2018-12-03 15:41:11,781 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:41:11,782 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 15:41:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:41:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:41:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:41:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2018-12-03 15:41:11,807 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 34 [2018-12-03 15:41:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:11,811 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2018-12-03 15:41:11,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2018-12-03 15:41:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:41:11,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:11,813 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:11,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -23931843, now seen corresponding path program 1 times [2018-12-03 15:41:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:11,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:11,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:11,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:11,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:11,950 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2018-12-03 15:41:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:12,198 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2018-12-03 15:41:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:12,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:41:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:12,202 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:41:12,203 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:41:12,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:41:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:41:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:41:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2018-12-03 15:41:12,224 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 34 [2018-12-03 15:41:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:12,226 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2018-12-03 15:41:12,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2018-12-03 15:41:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:41:12,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:12,230 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:12,230 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:12,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash -870093467, now seen corresponding path program 1 times [2018-12-03 15:41:12,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:12,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 15:41:12,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:12,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:12,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:12,316 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand 3 states. [2018-12-03 15:41:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:12,488 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2018-12-03 15:41:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:12,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 15:41:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:12,490 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:41:12,491 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:41:12,492 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 15:41:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:41:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:41:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:41:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2018-12-03 15:41:12,508 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 38 [2018-12-03 15:41:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:12,508 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2018-12-03 15:41:12,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2018-12-03 15:41:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:41:12,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:12,510 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:12,511 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:12,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1006859965, now seen corresponding path program 1 times [2018-12-03 15:41:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 15:41:12,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:12,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:12,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:12,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:12,603 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand 3 states. [2018-12-03 15:41:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:12,841 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2018-12-03 15:41:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:12,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:41:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:12,844 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:41:12,844 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:41:12,845 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 15:41:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:41:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 15:41:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:41:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2018-12-03 15:41:12,875 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 41 [2018-12-03 15:41:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:12,875 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2018-12-03 15:41:12,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2018-12-03 15:41:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:41:12,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:12,877 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:12,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:12,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1429561791, now seen corresponding path program 1 times [2018-12-03 15:41:12,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:12,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:12,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:12,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:12,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:12,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:12,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:12,935 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand 3 states. [2018-12-03 15:41:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:13,182 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2018-12-03 15:41:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:13,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:41:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:13,186 INFO L225 Difference]: With dead ends: 240 [2018-12-03 15:41:13,187 INFO L226 Difference]: Without dead ends: 238 [2018-12-03 15:41:13,187 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 15:41:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-03 15:41:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-12-03 15:41:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 15:41:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2018-12-03 15:41:13,250 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 41 [2018-12-03 15:41:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:13,250 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2018-12-03 15:41:13,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2018-12-03 15:41:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:41:13,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:13,259 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:13,259 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:13,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash -159729293, now seen corresponding path program 1 times [2018-12-03 15:41:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 15:41:13,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:13,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:13,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:13,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:13,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:13,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:13,375 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 3 states. [2018-12-03 15:41:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:13,755 INFO L93 Difference]: Finished difference Result 473 states and 659 transitions. [2018-12-03 15:41:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:13,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-03 15:41:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:13,758 INFO L225 Difference]: With dead ends: 473 [2018-12-03 15:41:13,758 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 15:41:13,759 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 15:41:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 15:41:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 15:41:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 15:41:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 324 transitions. [2018-12-03 15:41:13,790 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 324 transitions. Word has length 91 [2018-12-03 15:41:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:13,791 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 324 transitions. [2018-12-03 15:41:13,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 324 transitions. [2018-12-03 15:41:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:41:13,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:13,793 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:13,793 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:13,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2023902907, now seen corresponding path program 1 times [2018-12-03 15:41:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-12-03 15:41:13,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:13,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:13,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:13,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:13,911 INFO L87 Difference]: Start difference. First operand 237 states and 324 transitions. Second operand 3 states. [2018-12-03 15:41:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:14,382 INFO L93 Difference]: Finished difference Result 473 states and 647 transitions. [2018-12-03 15:41:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:14,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 15:41:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:14,386 INFO L225 Difference]: With dead ends: 473 [2018-12-03 15:41:14,386 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 15:41:14,387 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 15:41:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 15:41:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 15:41:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 15:41:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2018-12-03 15:41:14,417 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 100 [2018-12-03 15:41:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:14,418 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2018-12-03 15:41:14,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2018-12-03 15:41:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 15:41:14,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:14,420 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 7, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:14,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:14,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1040365903, now seen corresponding path program 1 times [2018-12-03 15:41:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:14,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-12-03 15:41:14,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:14,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:14,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:14,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:14,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:14,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:14,539 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand 3 states. [2018-12-03 15:41:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:14,760 INFO L93 Difference]: Finished difference Result 500 states and 668 transitions. [2018-12-03 15:41:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:14,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-03 15:41:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:14,762 INFO L225 Difference]: With dead ends: 500 [2018-12-03 15:41:14,763 INFO L226 Difference]: Without dead ends: 264 [2018-12-03 15:41:14,764 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 15:41:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-03 15:41:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-12-03 15:41:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-03 15:41:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2018-12-03 15:41:14,795 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 109 [2018-12-03 15:41:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:14,795 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2018-12-03 15:41:14,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2018-12-03 15:41:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:41:14,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:14,797 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:14,799 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:14,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2115374141, now seen corresponding path program 1 times [2018-12-03 15:41:14,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:14,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:14,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:14,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-03 15:41:14,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:14,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:14,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:14,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:14,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:14,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:14,960 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand 3 states. [2018-12-03 15:41:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:15,364 INFO L93 Difference]: Finished difference Result 557 states and 728 transitions. [2018-12-03 15:41:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:15,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-12-03 15:41:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:15,366 INFO L225 Difference]: With dead ends: 557 [2018-12-03 15:41:15,367 INFO L226 Difference]: Without dead ends: 294 [2018-12-03 15:41:15,368 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 15:41:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-03 15:41:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-03 15:41:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 15:41:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2018-12-03 15:41:15,399 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 118 [2018-12-03 15:41:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:15,400 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2018-12-03 15:41:15,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2018-12-03 15:41:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:41:15,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:15,402 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:15,402 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:15,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1302152706, now seen corresponding path program 1 times [2018-12-03 15:41:15,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:15,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:15,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-12-03 15:41:15,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:15,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:15,603 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-12-03 15:41:15,606 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [36], [40], [42], [46], [48], [50], [54], [56], [60], [62], [64], [68], [70], [74], [76], [78], [83], [85], [89], [91], [95], [97] [2018-12-03 15:41:15,671 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:15,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:16,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:16,828 INFO L272 AbstractInterpreter]: Visited 35 different actions 125 times. Merged at 28 different actions 59 times. Widened at 5 different actions 6 times. Found 34 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:41:16,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:16,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:16,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:16,877 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 15:41:16,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:16,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:17,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-12-03 15:41:17,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-12-03 15:41:17,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:17,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:17,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:17,357 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand 4 states. [2018-12-03 15:41:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:18,546 INFO L93 Difference]: Finished difference Result 640 states and 800 transitions. [2018-12-03 15:41:18,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:18,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-03 15:41:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:18,547 INFO L225 Difference]: With dead ends: 640 [2018-12-03 15:41:18,547 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:18,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:18,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2018-12-03 15:41:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:18,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:18,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:19,996 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-12-03 15:41:20,215 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-12-03 15:41:20,424 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-03 15:41:20,854 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2018-12-03 15:41:20,958 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-12-03 15:41:21,407 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2018-12-03 15:41:21,721 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-03 15:41:21,976 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-03 15:41:21,980 INFO L444 ceAbstractionStarter]: At program point L539(lines 310 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-12-03 15:41:21,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 473) no Hoare annotation was computed. [2018-12-03 15:41:21,981 INFO L444 ceAbstractionStarter]: At program point L354(lines 354 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse3 .cse4))) [2018-12-03 15:41:21,981 INFO L444 ceAbstractionStarter]: At program point L321(lines 279 321) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-12-03 15:41:21,982 INFO L444 ceAbstractionStarter]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-12-03 15:41:21,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 540) no Hoare annotation was computed. [2018-12-03 15:41:21,982 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 339) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-12-03 15:41:21,982 INFO L444 ceAbstractionStarter]: At program point L445(lines 445 472) the Hoare annotation is: false [2018-12-03 15:41:21,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 540) no Hoare annotation was computed. [2018-12-03 15:41:21,982 INFO L444 ceAbstractionStarter]: At program point L284(lines 284 311) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-12-03 15:41:21,982 INFO L444 ceAbstractionStarter]: At program point L474(lines 471 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L408(lines 408 430) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4))) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L375(lines 375 405) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse2 .cse3))) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L342(lines 342 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse4))) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L404(lines 404 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 388) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-12-03 15:41:21,983 INFO L444 ceAbstractionStarter]: At program point L433(lines 433 464) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-12-03 15:41:21,984 INFO L444 ceAbstractionStarter]: At program point L429(lines 429 446) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-12-03 15:41:21,984 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 409) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-12-03 15:41:21,984 INFO L444 ceAbstractionStarter]: At program point L421(lines 418 434) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-12-03 15:41:21,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 540) no Hoare annotation was computed. [2018-12-03 15:41:21,984 INFO L444 ceAbstractionStarter]: At program point L513(lines 513 530) the Hoare annotation is: (let ((.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) (and .cse0 .cse1 .cse3 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse5))) [2018-12-03 15:41:21,985 INFO L444 ceAbstractionStarter]: At program point L365(lines 360 376) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-12-03 15:41:21,985 INFO L444 ceAbstractionStarter]: At program point L493(lines 493 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-12-03 15:41:22,002 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:22 BoogieIcfgContainer [2018-12-03 15:41:22,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:22,003 INFO L168 Benchmark]: Toolchain (without parser) took 13772.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 648.5 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -116.2 MB). Peak memory consumption was 532.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:22,005 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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 15:41:22,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.46 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 15:41:22,006 INFO L168 Benchmark]: Boogie Preprocessor took 54.33 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 15:41:22,006 INFO L168 Benchmark]: RCFGBuilder took 936.13 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 15:41:22,007 INFO L168 Benchmark]: TraceAbstraction took 12723.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 648.5 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -147.9 MB). Peak memory consumption was 500.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:22,012 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.22 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 54.46 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 54.33 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 936.13 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 12723.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 648.5 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -147.9 MB). Peak memory consumption was 500.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 473]: 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: 408]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || (((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((((!(4400 == ssl3_connect_~s__state~4) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4))) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || ((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 175 SDslu, 130 SDs, 0 SdLazy, 432 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 367 NumberOfFragments, 731 HoareAnnotationTreeSize, 20 FomulaSimplifications, 9497 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1387 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1052 ConstructedInterpolants, 0 QuantifiedInterpolants, 125566 SizeOfPredicates, 2 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 3643/3658 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...