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_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:29,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:29,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:29,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:29,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:29,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:29,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:29,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:29,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:29,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:29,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:29,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:29,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:29,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:29,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:29,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:29,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:29,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:29,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:29,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:29,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:29,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:29,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:29,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:29,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:29,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:29,839 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:29,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:29,844 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:29,845 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:29,845 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:29,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:29,847 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:29,847 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:29,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:29,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:29,849 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:29,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:29,862 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:29,863 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:29,863 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:29,863 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:29,863 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:29,863 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:29,864 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:29,864 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:29,864 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:29,864 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:29,864 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:29,864 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:29,865 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:29,865 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:29,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:29,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:29,866 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:29,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:29,866 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:29,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:29,867 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:29,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:29,868 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:29,868 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:29,868 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:29,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:29,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:29,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:29,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:29,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:29,869 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:29,870 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:29,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:29,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:29,870 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:29,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:29,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:29,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:29,924 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:29,925 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:29,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-12-03 15:41:29,926 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-12-03 15:41:29,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:29,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:29,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:29,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:29,998 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:30,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:30,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:30,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:30,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:30,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/1) ... [2018-12-03 15:41:30,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:30,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:30,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:30,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:30,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (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:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:30,968 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:30,969 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:30,969 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:30 BoogieIcfgContainer [2018-12-03 15:41:30,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:30,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:30,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:30,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:30,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:29" (1/2) ... [2018-12-03 15:41:30,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be17847 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:30, skipping insertion in model container [2018-12-03 15:41:30,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:30" (2/2) ... [2018-12-03 15:41:30,977 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-12-03 15:41:30,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:30,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:31,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:31,044 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:31,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:31,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:31,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:31,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:31,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:31,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:31,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-03 15:41:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:41:31,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:31,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:31,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:31,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-12-03 15:41:31,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:31,314 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:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:31,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:31,339 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-03 15:41:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:31,723 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-12-03 15:41:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:31,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:41:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:31,745 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:41:31,745 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:41:31,756 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:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:41:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:41:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:41:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-12-03 15:41:31,807 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-12-03 15:41:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:31,807 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-12-03 15:41:31,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-12-03 15:41:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:41:31,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:31,810 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:31,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:31,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-12-03 15:41:31,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:31,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:31,921 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:31,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:31,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:31,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:31,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:31,925 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-12-03 15:41:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:32,280 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-12-03 15:41:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:32,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 15:41:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:32,283 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:41:32,283 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:41:32,284 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:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:41:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:41:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:41:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-12-03 15:41:32,297 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-12-03 15:41:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:32,298 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-12-03 15:41:32,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-12-03 15:41:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:32,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:32,300 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:32,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:32,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-12-03 15:41:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:32,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:32,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:32,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:32,389 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-12-03 15:41:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:32,610 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-12-03 15:41:32,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:32,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:41:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:32,614 INFO L225 Difference]: With dead ends: 106 [2018-12-03 15:41:32,614 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:41:32,615 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:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:41:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:41:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:41:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-12-03 15:41:32,628 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-12-03 15:41:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:32,629 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-12-03 15:41:32,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-12-03 15:41:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:32,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:32,631 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:32,631 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:32,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-12-03 15:41:32,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:32,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:32,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:32,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:32,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:32,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:32,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:32,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:32,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:32,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:32,767 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-12-03 15:41:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:33,215 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-12-03 15:41:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:33,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:41:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:33,217 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:41:33,217 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:41:33,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:41:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:41:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:41:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-12-03 15:41:33,235 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-12-03 15:41:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:33,236 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-12-03 15:41:33,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-12-03 15:41:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:41:33,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:33,238 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:33,238 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-12-03 15:41:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:33,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:41:33,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:33,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:33,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:33,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:33,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:33,315 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-12-03 15:41:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:33,681 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-12-03 15:41:33,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:33,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 15:41:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:33,683 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:41:33,684 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:41:33,685 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:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:41:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:41:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:41:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-12-03 15:41:33,701 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-12-03 15:41:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-12-03 15:41:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-12-03 15:41:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:41:33,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:33,706 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:33,706 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:33,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-12-03 15:41:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:33,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:33,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 15:41:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:33,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:33,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:33,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:33,829 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-12-03 15:41:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:33,969 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-12-03 15:41:33,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:33,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:41:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:33,974 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:41:33,974 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:41:33,975 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:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:41:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:41:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:41:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-12-03 15:41:34,007 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-12-03 15:41:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:34,007 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-12-03 15:41:34,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-12-03 15:41:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:41:34,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,012 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,013 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-12-03 15:41:34,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 15:41:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:34,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:34,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,108 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-12-03 15:41:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:34,300 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-12-03 15:41:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:41:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:34,303 INFO L225 Difference]: With dead ends: 181 [2018-12-03 15:41:34,303 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 15:41:34,304 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:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 15:41:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 15:41:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:41:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-12-03 15:41:34,321 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-12-03 15:41:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:34,322 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-12-03 15:41:34,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-12-03 15:41:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:41:34,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,324 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,324 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-12-03 15:41:34,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 15:41:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:34,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:34,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,399 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-12-03 15:41:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:34,649 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-12-03 15:41:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:34,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 15:41:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:34,653 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:41:34,653 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:41:34,654 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:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:41:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:41:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:41:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-12-03 15:41:34,671 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-12-03 15:41:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:34,672 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-12-03 15:41:34,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-12-03 15:41:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:41:34,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,674 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-12-03 15:41:34,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:34,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:34,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:34,803 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 15:41:34,805 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [64], [76], [88], [94] [2018-12-03 15:41:34,864 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:34,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:35,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:35,682 INFO L272 AbstractInterpreter]: Visited 22 different actions 57 times. Merged at 18 different actions 27 times. Never widened. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:41:35,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:35,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:35,729 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:35,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 15:41:35,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 15:41:35,934 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:35,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:41:35,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:35,936 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 3 states. [2018-12-03 15:41:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,177 INFO L93 Difference]: Finished difference Result 287 states and 398 transitions. [2018-12-03 15:41:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-03 15:41:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,180 INFO L225 Difference]: With dead ends: 287 [2018-12-03 15:41:36,180 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 15:41:36,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 15:41:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 15:41:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 15:41:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2018-12-03 15:41:36,219 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 48 [2018-12-03 15:41:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,219 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2018-12-03 15:41:36,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2018-12-03 15:41:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:41:36,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,221 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,222 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -410880489, now seen corresponding path program 1 times [2018-12-03 15:41:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:41:36,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:36,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,315 INFO L87 Difference]: Start difference. First operand 188 states and 259 transitions. Second operand 3 states. [2018-12-03 15:41:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,967 INFO L93 Difference]: Finished difference Result 397 states and 545 transitions. [2018-12-03 15:41:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-03 15:41:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,972 INFO L225 Difference]: With dead ends: 397 [2018-12-03 15:41:36,972 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 15:41:36,973 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:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 15:41:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-12-03 15:41:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 15:41:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 277 transitions. [2018-12-03 15:41:37,013 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 277 transitions. Word has length 55 [2018-12-03 15:41:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:37,014 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 277 transitions. [2018-12-03 15:41:37,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 277 transitions. [2018-12-03 15:41:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:41:37,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:37,015 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:37,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:37,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1519739157, now seen corresponding path program 1 times [2018-12-03 15:41:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:37,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:37,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:37,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 93 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:37,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:37,185 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-03 15:41:37,185 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [64], [74], [76], [82], [88], [92], [94] [2018-12-03 15:41:37,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:37,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:37,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:37,586 INFO L272 AbstractInterpreter]: Visited 25 different actions 66 times. Merged at 21 different actions 32 times. Never widened. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:41:37,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:37,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:37,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:37,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:37,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:37,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:37,939 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:37,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 15:41:37,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:37,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:37,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:37,942 INFO L87 Difference]: Start difference. First operand 208 states and 277 transitions. Second operand 3 states. [2018-12-03 15:41:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:38,174 INFO L93 Difference]: Finished difference Result 308 states and 410 transitions. [2018-12-03 15:41:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:38,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-03 15:41:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:38,178 INFO L225 Difference]: With dead ends: 308 [2018-12-03 15:41:38,179 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 15:41:38,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 15:41:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-03 15:41:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 15:41:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 408 transitions. [2018-12-03 15:41:38,216 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 408 transitions. Word has length 63 [2018-12-03 15:41:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:38,217 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 408 transitions. [2018-12-03 15:41:38,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 408 transitions. [2018-12-03 15:41:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:41:38,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:38,219 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:38,219 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1160238119, now seen corresponding path program 1 times [2018-12-03 15:41:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:38,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 267 proven. 8 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-03 15:41:38,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:38,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:38,417 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-12-03 15:41:38,417 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [50], [52], [56], [58], [62], [64], [68], [74], [76], [78], [82], [84], [88], [92], [94] [2018-12-03 15:41:38,421 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:38,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:38,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:38,895 INFO L272 AbstractInterpreter]: Visited 31 different actions 112 times. Merged at 23 different actions 57 times. Widened at 5 different actions 5 times. Found 33 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:41:38,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:38,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:38,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:38,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:38,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:39,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-12-03 15:41:39,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-12-03 15:41:39,343 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:41:39,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:41:39,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:39,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:39,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:39,344 INFO L87 Difference]: Start difference. First operand 306 states and 408 transitions. Second operand 3 states. [2018-12-03 15:41:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:39,746 INFO L93 Difference]: Finished difference Result 611 states and 815 transitions. [2018-12-03 15:41:39,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:39,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 15:41:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:39,748 INFO L225 Difference]: With dead ends: 611 [2018-12-03 15:41:39,749 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 15:41:39,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 15:41:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-03 15:41:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 15:41:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2018-12-03 15:41:39,781 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 113 [2018-12-03 15:41:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:39,782 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2018-12-03 15:41:39,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2018-12-03 15:41:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:41:39,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:39,783 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:39,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:39,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1708757697, now seen corresponding path program 1 times [2018-12-03 15:41:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 267 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-03 15:41:39,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:39,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:39,989 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-03 15:41:39,989 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [46], [52], [58], [62], [64], [68], [74], [76], [78], [82], [84], [88], [90], [92], [94] [2018-12-03 15:41:39,994 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:39,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:40,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:40,337 INFO L272 AbstractInterpreter]: Visited 30 different actions 101 times. Merged at 24 different actions 49 times. Widened at 3 different actions 3 times. Found 29 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 15:41:40,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:40,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:40,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:40,375 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:40,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:40,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 267 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-03 15:41:40,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 267 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-03 15:41:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:40,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:40,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:40,647 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand 4 states. [2018-12-03 15:41:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:41,198 INFO L93 Difference]: Finished difference Result 735 states and 946 transitions. [2018-12-03 15:41:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:41,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-03 15:41:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:41,206 INFO L225 Difference]: With dead ends: 735 [2018-12-03 15:41:41,206 INFO L226 Difference]: Without dead ends: 414 [2018-12-03 15:41:41,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-03 15:41:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 302. [2018-12-03 15:41:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-12-03 15:41:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2018-12-03 15:41:41,245 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 114 [2018-12-03 15:41:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:41,245 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2018-12-03 15:41:41,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2018-12-03 15:41:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:41:41,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:41,247 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:41,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:41,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1041971577, now seen corresponding path program 1 times [2018-12-03 15:41:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-12-03 15:41:41,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:41,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:41,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:41,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:41,346 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand 3 states. [2018-12-03 15:41:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:41,998 INFO L93 Difference]: Finished difference Result 606 states and 760 transitions. [2018-12-03 15:41:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:41,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-12-03 15:41:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,001 INFO L225 Difference]: With dead ends: 606 [2018-12-03 15:41:42,001 INFO L226 Difference]: Without dead ends: 296 [2018-12-03 15:41:42,002 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:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-03 15:41:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-12-03 15:41:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-03 15:41:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 351 transitions. [2018-12-03 15:41:42,040 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 351 transitions. Word has length 147 [2018-12-03 15:41:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,040 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 351 transitions. [2018-12-03 15:41:42,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 351 transitions. [2018-12-03 15:41:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:41:42,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,042 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:42,042 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-12-03 15:41:42,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-12-03 15:41:42,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:42,213 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-12-03 15:41:42,213 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [62], [64], [68], [70], [74], [76], [78], [82], [84], [88], [90], [92], [94] [2018-12-03 15:41:42,216 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:42,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:42,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:42,482 INFO L272 AbstractInterpreter]: Visited 34 different actions 86 times. Merged at 25 different actions 36 times. Never widened. Found 28 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:41:42,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:42,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,513 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:42,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:42,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-12-03 15:41:42,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-12-03 15:41:42,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:42,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:42,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:42,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:42,767 INFO L87 Difference]: Start difference. First operand 296 states and 351 transitions. Second operand 4 states. [2018-12-03 15:41:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,988 INFO L93 Difference]: Finished difference Result 470 states and 562 transitions. [2018-12-03 15:41:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:41:42,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-12-03 15:41:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,989 INFO L225 Difference]: With dead ends: 470 [2018-12-03 15:41:42,989 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:42,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:42,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-12-03 15:41:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,992 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:42,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:42,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:42,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:43,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:43,805 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-03 15:41:44,435 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 15:41:44,742 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2018-12-03 15:41:44,887 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-03 15:41:45,170 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 15:41:45,394 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 15:41:45,618 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-12-03 15:41:45,822 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-12-03 15:41:45,984 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-12-03 15:41:46,124 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2018-12-03 15:41:46,328 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-12-03 15:41:46,523 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-03 15:41:46,642 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2018-12-03 15:41:46,732 INFO L444 ceAbstractionStarter]: At program point L415(lines 415 427) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,733 INFO L444 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-12-03 15:41:46,733 INFO L444 ceAbstractionStarter]: At program point L370(lines 370 378) the Hoare annotation is: (let ((.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse8 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse2 .cse8 .cse3 .cse9 .cse4 .cse5 .cse6))) [2018-12-03 15:41:46,733 INFO L444 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,733 INFO L444 ceAbstractionStarter]: At program point L461(lines 461 482) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-12-03 15:41:46,733 INFO L444 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-12-03 15:41:46,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-12-03 15:41:46,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-12-03 15:41:46,734 INFO L444 ceAbstractionStarter]: At program point L313(lines 313 324) the Hoare annotation is: (let ((.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,734 INFO L444 ceAbstractionStarter]: At program point L400(lines 400 412) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-12-03 15:41:46,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) no Hoare annotation was computed. [2018-12-03 15:41:46,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-12-03 15:41:46,735 INFO L444 ceAbstractionStarter]: At program point L380(lines 380 397) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,735 INFO L444 ceAbstractionStarter]: At program point L347(lines 347 365) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse5 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse4 .cse5 .cse8 .cse2) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse3 .cse4 .cse9 .cse5 .cse8 .cse1 .cse2 .cse6) (and .cse3 .cse7 .cse4 .cse9 .cse2))) [2018-12-03 15:41:46,735 INFO L444 ceAbstractionStarter]: At program point L442(lines 442 462) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1))) [2018-12-03 15:41:46,735 INFO L444 ceAbstractionStarter]: At program point L504(lines 286 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,735 INFO L444 ceAbstractionStarter]: At program point L438(lines 438 449) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 439) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse4 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L484(lines 481 499) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L451(lines 448 470) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,736 INFO L444 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-12-03 15:41:46,754 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:46 BoogieIcfgContainer [2018-12-03 15:41:46,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:46,755 INFO L168 Benchmark]: Toolchain (without parser) took 16759.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -822.8 MB). Peak memory consumption was 769.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:46,757 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:46,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.69 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:46,758 INFO L168 Benchmark]: Boogie Preprocessor took 67.49 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:46,758 INFO L168 Benchmark]: RCFGBuilder took 852.00 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:46,759 INFO L168 Benchmark]: TraceAbstraction took 15784.46 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -854.5 MB). Peak memory consumption was 737.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:46,763 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.69 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 67.49 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 852.00 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 15784.46 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -854.5 MB). Peak memory consumption was 737.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((((((!(8512 == ssl3_accept_~s__state~5) && !(8608 == ssl3_accept_~s__state~5)) && ssl3_accept_~blastFlag~5 <= 3) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: ((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8608 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8608 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8608 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8608 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ((((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (((((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8512 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 15.7s OverallTime, 15 OverallIterations, 19 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 191 SDslu, 128 SDs, 0 SdLazy, 506 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 1053 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.5s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 112 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 227 NumberOfFragments, 1051 HoareAnnotationTreeSize, 19 FomulaSimplifications, 10260 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3799 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1518 NumberOfCodeBlocks, 1518 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2019 ConstructedInterpolants, 0 QuantifiedInterpolants, 300999 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2729 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 7933/8005 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...