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_2_alt.BV.c.cil.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:24,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:24,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:24,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:24,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:24,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:24,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:25,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:25,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:25,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:25,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:25,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:25,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:25,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:25,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:25,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:25,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:25,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:25,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:25,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:25,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:25,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:25,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:25,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:25,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:25,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:25,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:25,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:25,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:25,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:25,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:25,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:25,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:25,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:25,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:25,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:25,033 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:25,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:25,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:25,047 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:25,047 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:25,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:25,047 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:25,048 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:25,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:25,048 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:25,048 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:25,048 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:25,049 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:25,049 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:25,049 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:25,049 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:25,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:25,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:25,050 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:25,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:25,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:25,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:25,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:25,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:25,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:25,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:25,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:25,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:25,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:25,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:25,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:25,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:25,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:25,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:25,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:25,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:25,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:25,054 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:25,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:25,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:25,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:25,055 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:25,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:25,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:25,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:25,103 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:25,104 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:25,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2_alt.BV.c.cil.c_13.bpl [2018-12-03 15:41:25,105 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2_alt.BV.c.cil.c_13.bpl' [2018-12-03 15:41:25,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:25,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:25,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:25,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:25,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:25,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:25,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:25,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:25,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:25,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/1) ... [2018-12-03 15:41:25,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:25,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:25,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:25,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:25,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (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:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:25,996 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:25,997 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:25,997 INFO L202 PluginConnector]: Adding new model s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:25 BoogieIcfgContainer [2018-12-03 15:41:25,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:25,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:25,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:26,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:26,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:25" (1/2) ... [2018-12-03 15:41:26,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156cc88a and model type s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:26, skipping insertion in model container [2018-12-03 15:41:26,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:25" (2/2) ... [2018-12-03 15:41:26,006 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_alt.BV.c.cil.c_13.bpl [2018-12-03 15:41:26,016 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:26,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:26,041 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:26,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:26,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:26,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:26,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:26,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:26,077 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:26,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:26,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 15:41:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:41:26,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:26,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:26,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:26,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash 212232727, now seen corresponding path program 1 times [2018-12-03 15:41:26,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:26,353 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:26,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:26,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:26,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:26,381 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 15:41:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:26,572 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2018-12-03 15:41:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:26,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 15:41:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:26,587 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:41:26,588 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:41:26,592 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:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:41:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:41:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:41:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-03 15:41:26,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 8 [2018-12-03 15:41:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:26,632 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-03 15:41:26,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-12-03 15:41:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:41:26,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:26,633 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:26,634 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:26,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -250815121, now seen corresponding path program 1 times [2018-12-03 15:41:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:26,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:26,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:26,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:26,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:26,753 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 3 states. [2018-12-03 15:41:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:26,868 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2018-12-03 15:41:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:26,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 15:41:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:26,871 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:41:26,871 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:41:26,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:41:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:41:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:41:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2018-12-03 15:41:26,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 11 [2018-12-03 15:41:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:26,883 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2018-12-03 15:41:26,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-03 15:41:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:41:26,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:26,885 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:26,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:26,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1416638413, now seen corresponding path program 1 times [2018-12-03 15:41:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:26,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:41:26,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:26,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:26,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:26,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:26,981 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 3 states. [2018-12-03 15:41:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:27,167 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-12-03 15:41:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:27,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 15:41:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:27,176 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:41:27,176 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:41:27,177 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:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:41:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:41:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:41:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-03 15:41:27,192 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 19 [2018-12-03 15:41:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:27,192 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-03 15:41:27,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-03 15:41:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:41:27,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:27,194 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:27,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:27,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1648077349, now seen corresponding path program 1 times [2018-12-03 15:41:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:27,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:27,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:27,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:27,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:27,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:27,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:27,293 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 3 states. [2018-12-03 15:41:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:27,513 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-12-03 15:41:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:27,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:41:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:27,517 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:41:27,517 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:41:27,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:41:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-12-03 15:41:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:41:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2018-12-03 15:41:27,533 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 22 [2018-12-03 15:41:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:27,534 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-12-03 15:41:27,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2018-12-03 15:41:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:41:27,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:27,536 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:27,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:27,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash 494540487, now seen corresponding path program 1 times [2018-12-03 15:41:27,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:27,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:27,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:27,648 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:27,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:27,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:27,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:27,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:27,650 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 3 states. [2018-12-03 15:41:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:27,733 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-03 15:41:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:27,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 15:41:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:27,735 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:41:27,735 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:41:27,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:41:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-03 15:41:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:41:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-12-03 15:41:27,752 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 25 [2018-12-03 15:41:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:27,753 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-12-03 15:41:27,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-12-03 15:41:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:41:27,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:27,756 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:27,756 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:27,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1543638863, now seen corresponding path program 1 times [2018-12-03 15:41:27,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:27,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:27,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:27,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:27,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:27,933 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-03 15:41:27,935 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [30], [34], [36], [40], [42], [46], [48], [50], [52] [2018-12-03 15:41:27,978 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:27,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:28,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:28,808 INFO L272 AbstractInterpreter]: Visited 20 different actions 64 times. Merged at 14 different actions 29 times. Never widened. Found 15 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:41:28,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:28,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:28,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:28,841 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:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:28,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:28,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:28,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:29,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:29,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:29,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:29,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:29,071 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-12-03 15:41:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:29,380 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2018-12-03 15:41:29,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:29,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 15:41:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:29,384 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:41:29,384 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:29,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:29,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-12-03 15:41:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:29,388 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:29,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:29,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:29,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:29,814 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-12-03 15:41:29,990 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 15:41:30,381 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-12-03 15:41:30,673 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-12-03 15:41:30,749 INFO L444 ceAbstractionStarter]: At program point L254(lines 254 270) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:30,750 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 381) the Hoare annotation is: false [2018-12-03 15:41:30,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 383) no Hoare annotation was computed. [2018-12-03 15:41:30,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 383) no Hoare annotation was computed. [2018-12-03 15:41:30,750 INFO L444 ceAbstractionStarter]: At program point L309(lines 304 328) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:30,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 382) no Hoare annotation was computed. [2018-12-03 15:41:30,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 383) no Hoare annotation was computed. [2018-12-03 15:41:30,751 INFO L444 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:30,751 INFO L444 ceAbstractionStarter]: At program point L380(lines 269 380) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:30,751 INFO L444 ceAbstractionStarter]: At program point L343(lines 343 358) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:30,751 INFO L444 ceAbstractionStarter]: At program point L298(lines 298 317) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-12-03 15:41:30,752 INFO L444 ceAbstractionStarter]: At program point L360(lines 357 375) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:30,752 INFO L444 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-12-03 15:41:30,752 INFO L444 ceAbstractionStarter]: At program point L286(lines 286 305) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1)) [2018-12-03 15:41:30,752 INFO L444 ceAbstractionStarter]: At program point L278(lines 241 278) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:30,753 INFO L444 ceAbstractionStarter]: At program point L274(lines 274 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:30,773 INFO L202 PluginConnector]: Adding new model s3_srvr_2_alt.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:30 BoogieIcfgContainer [2018-12-03 15:41:30,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:30,775 INFO L168 Benchmark]: Toolchain (without parser) took 5602.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -578.7 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:30,778 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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:30,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.37 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:30,779 INFO L168 Benchmark]: Boogie Preprocessor took 66.80 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:30,780 INFO L168 Benchmark]: RCFGBuilder took 696.97 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:30,782 INFO L168 Benchmark]: TraceAbstraction took 4774.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -610.4 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:30,789 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.16 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 55.37 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 66.80 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 696.97 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 4774.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -610.4 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 382]: 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: 298]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8640 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 1 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 111 SDtfs, 48 SDslu, 52 SDs, 0 SdLazy, 101 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 103 NumberOfFragments, 188 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1189 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 12691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 397/409 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...