java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:49:06,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:49:06,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:49:06,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:49:06,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:49:06,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:49:06,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:49:06,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:49:06,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:49:06,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:49:06,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:49:06,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:49:06,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:49:06,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:49:06,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:49:06,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:49:06,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:49:06,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:49:06,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:49:06,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:49:06,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:49:06,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:49:06,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:49:06,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:49:06,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:49:06,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:49:06,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:49:06,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:49:06,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:49:06,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:49:06,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:49:06,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:49:06,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:49:06,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:49:06,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:49:06,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:49:06,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:49:06,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:49:06,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:49:06,738 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:49:06,739 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:49:06,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:49:06,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:49:06,740 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:49:06,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:49:06,740 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:49:06,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:49:06,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:49:06,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:49:06,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:49:06,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:49:06,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:49:06,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:49:06,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:49:06,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:49:06,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:49:06,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:49:06,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:49:06,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:49:06,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:06,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:49:06,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:49:06,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:49:06,746 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:49:06,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:49:06,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:49:06,747 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:49:06,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:49:06,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:49:06,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:49:06,846 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:49:06,847 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:49:06,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-10-02 11:49:06,848 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-10-02 11:49:06,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:49:06,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:49:06,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:06,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:49:06,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:49:06,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:06,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:06,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:06,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:49:06,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:49:06,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:49:07,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/1) ... [2018-10-02 11:49:07,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:49:07,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:49:07,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:49:07,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:49:07,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (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-10-02 11:49:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:49:07,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:49:07,907 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:49:07,907 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:07 BoogieIcfgContainer [2018-10-02 11:49:07,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:49:07,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:49:07,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:49:07,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:49:07,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:06" (1/2) ... [2018-10-02 11:49:07,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176c5313 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:07, skipping insertion in model container [2018-10-02 11:49:07,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:07" (2/2) ... [2018-10-02 11:49:07,917 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-10-02 11:49:07,926 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:49:07,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:49:07,984 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:49:07,985 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:49:07,985 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:49:07,985 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:49:07,985 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:49:07,985 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:49:07,986 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:49:07,986 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:49:07,986 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:49:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-02 11:49:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:49:08,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:08,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:08,012 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:08,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-10-02 11:49:08,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:08,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:08,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:08,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:08,260 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-02 11:49:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:08,604 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-10-02 11:49:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:08,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:49:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:08,618 INFO L225 Difference]: With dead ends: 60 [2018-10-02 11:49:08,618 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 11:49:08,623 INFO L605 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-10-02 11:49:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 11:49:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 11:49:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 11:49:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-10-02 11:49:08,670 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-10-02 11:49:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:08,671 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-10-02 11:49:08,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-10-02 11:49:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:49:08,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:08,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:08,673 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:08,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:08,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-10-02 11:49:08,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:08,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:08,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:08,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:08,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:08,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:08,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:08,761 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-10-02 11:49:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:09,094 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-10-02 11:49:09,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:09,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-02 11:49:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:09,096 INFO L225 Difference]: With dead ends: 87 [2018-10-02 11:49:09,096 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 11:49:09,097 INFO L605 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-10-02 11:49:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 11:49:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-02 11:49:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 11:49:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-10-02 11:49:09,118 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-10-02 11:49:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:09,119 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-10-02 11:49:09,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-02 11:49:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:49:09,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:09,122 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:09,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:09,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-10-02 11:49:09,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:09,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:09,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 11:49:09,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:09,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:09,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:09,233 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-10-02 11:49:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:09,452 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-10-02 11:49:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:09,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-02 11:49:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:09,454 INFO L225 Difference]: With dead ends: 110 [2018-10-02 11:49:09,454 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 11:49:09,457 INFO L605 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-10-02 11:49:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 11:49:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 11:49:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 11:49:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-10-02 11:49:09,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-10-02 11:49:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:09,478 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-10-02 11:49:09,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-10-02 11:49:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:49:09,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:09,480 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:09,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:09,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-10-02 11:49:09,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:09,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:09,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:09,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:09,588 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-10-02 11:49:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:09,868 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-10-02 11:49:09,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:09,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-02 11:49:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:09,873 INFO L225 Difference]: With dead ends: 135 [2018-10-02 11:49:09,874 INFO L226 Difference]: Without dead ends: 76 [2018-10-02 11:49:09,879 INFO L605 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-10-02 11:49:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-02 11:49:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-02 11:49:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-02 11:49:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-10-02 11:49:09,901 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-10-02 11:49:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:09,901 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-10-02 11:49:09,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-10-02 11:49:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 11:49:09,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:09,905 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:09,906 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:09,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-10-02 11:49:09,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:09,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:09,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:09,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-02 11:49:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:10,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:10,011 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-10-02 11:49:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:10,432 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-10-02 11:49:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:10,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-02 11:49:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:10,433 INFO L225 Difference]: With dead ends: 157 [2018-10-02 11:49:10,434 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 11:49:10,435 INFO L605 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-10-02 11:49:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 11:49:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-02 11:49:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-02 11:49:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-10-02 11:49:10,457 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-10-02 11:49:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:10,458 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-10-02 11:49:10,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-10-02 11:49:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 11:49:10,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:10,461 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:10,462 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-10-02 11:49:10,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:10,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:10,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-02 11:49:10,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:10,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:10,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:10,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:10,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:10,513 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-10-02 11:49:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:10,712 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-10-02 11:49:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:10,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-02 11:49:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:10,715 INFO L225 Difference]: With dead ends: 168 [2018-10-02 11:49:10,715 INFO L226 Difference]: Without dead ends: 87 [2018-10-02 11:49:10,716 INFO L605 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-10-02 11:49:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-02 11:49:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-02 11:49:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-02 11:49:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-10-02 11:49:10,735 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-10-02 11:49:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:10,736 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-10-02 11:49:10,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-10-02 11:49:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 11:49:10,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:10,739 INFO L375 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, 1] [2018-10-02 11:49:10,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:10,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-10-02 11:49:10,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:10,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:10,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:10,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-02 11:49:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:10,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:10,806 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-10-02 11:49:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:11,109 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-10-02 11:49:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:11,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-02 11:49:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:11,111 INFO L225 Difference]: With dead ends: 185 [2018-10-02 11:49:11,112 INFO L226 Difference]: Without dead ends: 98 [2018-10-02 11:49:11,114 INFO L605 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-10-02 11:49:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-02 11:49:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-02 11:49:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-02 11:49:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-10-02 11:49:11,143 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-10-02 11:49:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:11,144 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-10-02 11:49:11,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-10-02 11:49:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:49:11,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:11,151 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:11,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:11,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-10-02 11:49:11,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:11,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-02 11:49:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:11,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:11,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:11,252 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-10-02 11:49:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:11,410 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-10-02 11:49:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:11,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-02 11:49:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:11,413 INFO L225 Difference]: With dead ends: 285 [2018-10-02 11:49:11,413 INFO L226 Difference]: Without dead ends: 188 [2018-10-02 11:49:11,414 INFO L605 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-10-02 11:49:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-02 11:49:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-02 11:49:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-02 11:49:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-10-02 11:49:11,444 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-10-02 11:49:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:11,444 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-10-02 11:49:11,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-10-02 11:49:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-02 11:49:11,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:11,447 INFO L375 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, 1] [2018-10-02 11:49:11,447 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:11,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-10-02 11:49:11,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:11,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:11,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:49:11,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:11,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:49:11,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:11,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 11:49:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 11:49:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:49:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:49:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:11,846 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-10-02 11:49:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:12,896 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-10-02 11:49:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:49:12,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-02 11:49:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:12,900 INFO L225 Difference]: With dead ends: 695 [2018-10-02 11:49:12,900 INFO L226 Difference]: Without dead ends: 486 [2018-10-02 11:49:12,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:49:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-02 11:49:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-10-02 11:49:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-02 11:49:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-10-02 11:49:12,959 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-10-02 11:49:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:12,959 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-10-02 11:49:12,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:49:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-10-02 11:49:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:49:12,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:12,961 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:12,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:12,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-10-02 11:49:12,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:12,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:12,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:12,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 11:49:13,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:13,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:13,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:13,047 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-10-02 11:49:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:13,312 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-10-02 11:49:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:13,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-02 11:49:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:13,314 INFO L225 Difference]: With dead ends: 466 [2018-10-02 11:49:13,315 INFO L226 Difference]: Without dead ends: 279 [2018-10-02 11:49:13,315 INFO L605 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-10-02 11:49:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-02 11:49:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-02 11:49:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-02 11:49:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-10-02 11:49:13,357 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-10-02 11:49:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:13,357 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-10-02 11:49:13,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-10-02 11:49:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-02 11:49:13,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:13,359 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:13,359 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:13,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-10-02 11:49:13,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-02 11:49:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:13,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:13,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:13,455 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-10-02 11:49:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:13,737 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-10-02 11:49:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:13,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-10-02 11:49:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:13,739 INFO L225 Difference]: With dead ends: 464 [2018-10-02 11:49:13,740 INFO L226 Difference]: Without dead ends: 278 [2018-10-02 11:49:13,740 INFO L605 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-10-02 11:49:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-02 11:49:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-02 11:49:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-02 11:49:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-10-02 11:49:13,781 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-10-02 11:49:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:13,782 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-10-02 11:49:13,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-10-02 11:49:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 11:49:13,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:13,784 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:13,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:13,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-10-02 11:49:13,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:13,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 11:49:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:13,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:13,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:13,876 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-10-02 11:49:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:14,160 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-10-02 11:49:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:14,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-02 11:49:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:14,162 INFO L225 Difference]: With dead ends: 548 [2018-10-02 11:49:14,162 INFO L226 Difference]: Without dead ends: 276 [2018-10-02 11:49:14,163 INFO L605 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-10-02 11:49:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-02 11:49:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-02 11:49:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-02 11:49:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-10-02 11:49:14,201 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-10-02 11:49:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:14,202 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-10-02 11:49:14,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-10-02 11:49:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-02 11:49:14,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:14,203 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:14,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:14,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-10-02 11:49:14,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:14,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:14,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-02 11:49:14,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:14,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:14,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:14,326 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-10-02 11:49:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:14,684 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-10-02 11:49:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:14,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-02 11:49:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:14,686 INFO L225 Difference]: With dead ends: 543 [2018-10-02 11:49:14,686 INFO L226 Difference]: Without dead ends: 274 [2018-10-02 11:49:14,689 INFO L605 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-10-02 11:49:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-02 11:49:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-02 11:49:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-02 11:49:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-10-02 11:49:14,733 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-10-02 11:49:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:14,733 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-10-02 11:49:14,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-10-02 11:49:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-02 11:49:14,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:14,735 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:14,735 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:14,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-10-02 11:49:14,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:14,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-02 11:49:14,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:14,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:14,860 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-10-02 11:49:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:15,336 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-10-02 11:49:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:15,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-02 11:49:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:15,338 INFO L225 Difference]: With dead ends: 543 [2018-10-02 11:49:15,338 INFO L226 Difference]: Without dead ends: 277 [2018-10-02 11:49:15,339 INFO L605 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-10-02 11:49:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-02 11:49:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-02 11:49:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-02 11:49:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-10-02 11:49:15,378 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-10-02 11:49:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:15,378 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-10-02 11:49:15,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-10-02 11:49:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-02 11:49:15,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:15,379 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:15,380 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:15,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-10-02 11:49:15,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:15,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-02 11:49:15,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:15,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:15,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:15,483 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-10-02 11:49:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:15,964 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-10-02 11:49:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:15,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-02 11:49:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:15,967 INFO L225 Difference]: With dead ends: 576 [2018-10-02 11:49:15,967 INFO L226 Difference]: Without dead ends: 307 [2018-10-02 11:49:15,968 INFO L605 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-10-02 11:49:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-02 11:49:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-02 11:49:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-02 11:49:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-10-02 11:49:16,004 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-10-02 11:49:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:16,004 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-10-02 11:49:16,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-10-02 11:49:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-02 11:49:16,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:16,006 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:16,006 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:16,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-10-02 11:49:16,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-02 11:49:16,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:16,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:16,118 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-10-02 11:49:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:16,384 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-10-02 11:49:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:16,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-02 11:49:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:16,390 INFO L225 Difference]: With dead ends: 606 [2018-10-02 11:49:16,390 INFO L226 Difference]: Without dead ends: 403 [2018-10-02 11:49:16,391 INFO L605 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-10-02 11:49:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-02 11:49:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-02 11:49:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 11:49:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-10-02 11:49:16,436 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-10-02 11:49:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:16,436 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-10-02 11:49:16,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-10-02 11:49:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-02 11:49:16,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:16,438 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:16,439 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:16,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-10-02 11:49:16,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:16,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-02 11:49:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:16,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:16,561 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-10-02 11:49:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:16,757 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-10-02 11:49:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:16,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-02 11:49:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:16,763 INFO L225 Difference]: With dead ends: 798 [2018-10-02 11:49:16,763 INFO L226 Difference]: Without dead ends: 403 [2018-10-02 11:49:16,764 INFO L605 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-10-02 11:49:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-02 11:49:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-02 11:49:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 11:49:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-10-02 11:49:16,813 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-10-02 11:49:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:16,813 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-10-02 11:49:16,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-10-02 11:49:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-02 11:49:16,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:16,816 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:16,817 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:16,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-10-02 11:49:16,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 11:49:17,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:17,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:49:17,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:17,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-10-02 11:49:17,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:17,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 11:49:17,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:49:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:49:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:17,351 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-10-02 11:49:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:17,526 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-10-02 11:49:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:49:17,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-02 11:49:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:17,532 INFO L225 Difference]: With dead ends: 643 [2018-10-02 11:49:17,532 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:17,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:49:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:17,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-10-02 11:49:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:17,536 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:17,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:49:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:17,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:17,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:17,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:18,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:19,867 WARN L178 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 11:49:20,331 WARN L178 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 11:49:20,646 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 11:49:21,050 WARN L178 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-02 11:49:21,230 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 11:49:21,444 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-02 11:49:21,591 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-02 11:49:21,936 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-10-02 11:49:22,180 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-10-02 11:49:22,310 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-02 11:49:22,544 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-10-02 11:49:22,697 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 11:49:22,727 INFO L421 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 11:49:22,727 INFO L421 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,727 INFO L421 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 11:49:22,728 INFO L421 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 11:49:22,728 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-02 11:49:22,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-10-02 11:49:22,728 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-10-02 11:49:22,729 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 11:49:22,729 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-02 11:49:22,729 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-10-02 11:49:22,729 INFO L421 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,729 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,729 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)))) [2018-10-02 11:49:22,730 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-10-02 11:49:22,731 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 11:49:22,731 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 11:49:22,731 INFO L421 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 11:49:22,731 INFO L421 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 11:49:22,731 INFO L421 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 11:49:22,752 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:22 BoogieIcfgContainer [2018-10-02 11:49:22,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:22,753 INFO L168 Benchmark]: Toolchain (without parser) took 15820.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 102.0 MB). Peak memory consumption was 611.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:22,754 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:22,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:22,755 INFO L168 Benchmark]: Boogie Preprocessor took 58.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:22,756 INFO L168 Benchmark]: RCFGBuilder took 855.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10-02 11:49:22,757 INFO L168 Benchmark]: TraceAbstraction took 14843.65 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Peak memory consumption was 579.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:22,761 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 855.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 14843.65 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Peak memory consumption was 579.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 14.7s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-49-22-778.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-49-22-778.csv Received shutdown request...