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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:43,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:43,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:43,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:43,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:43,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:43,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:43,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:43,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:43,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:43,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:43,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:43,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:43,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:43,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:43,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:43,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:43,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:43,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:43,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:43,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:43,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:43,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:43,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:43,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:43,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:43,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:43,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:43,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:43,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:43,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:43,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:43,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:43,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:43,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:43,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:43,616 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:53:43,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:43,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:43,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:43,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:43,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:43,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:43,648 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:43,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:43,650 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:43,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:43,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:43,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:43,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:43,651 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:43,651 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:43,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:43,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:43,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:43,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:43,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:43,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:43,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:43,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:43,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:43,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:43,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:43,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:43,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:43,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:43,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:43,655 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:43,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:43,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:43,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:43,746 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:43,747 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:43,748 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-09-26 21:53:43,748 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-09-26 21:53:43,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:43,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:43,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:43,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:43,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:43,861 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,877 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:43,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:43,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:43,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:43,899 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,899 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,903 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,903 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,932 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,935 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,937 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 26.09 09:53:43" (1/1) ... [2018-09-26 21:53:43,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:43,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:43,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:43,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:43,954 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 26.09 09:53:43" (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-09-26 21:53:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:44,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:44,701 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:44,701 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:44 BoogieIcfgContainer [2018-09-26 21:53:44,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:44,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:44,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:44,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:44,706 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 26.09 09:53:43" (1/2) ... [2018-09-26 21:53:44,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e51dcb and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:44, skipping insertion in model container [2018-09-26 21:53:44,707 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 26.09 09:53:44" (2/2) ... [2018-09-26 21:53:44,709 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-09-26 21:53:44,718 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:44,726 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:44,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:44,776 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:44,776 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:44,776 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:44,776 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:44,777 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:44,777 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:44,777 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:44,777 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-09-26 21:53:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:53:44,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:44,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:44,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:44,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-09-26 21:53:44,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:44,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:45,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:45,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:45,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:45,067 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:45,070 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-09-26 21:53:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:45,829 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-09-26 21:53:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:53:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:45,845 INFO L225 Difference]: With dead ends: 60 [2018-09-26 21:53:45,846 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 21:53:45,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 21:53:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 21:53:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 21:53:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-09-26 21:53:45,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-09-26 21:53:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:45,894 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-09-26 21:53:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-09-26 21:53:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:53:45,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:45,896 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:45,897 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:45,898 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-09-26 21:53:45,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:45,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:45,995 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:45,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:45,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:45,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:45,998 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-09-26 21:53:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:46,607 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-09-26 21:53:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:46,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-26 21:53:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:46,609 INFO L225 Difference]: With dead ends: 87 [2018-09-26 21:53:46,610 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 21:53:46,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 21:53:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 21:53:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 21:53:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-09-26 21:53:46,636 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-09-26 21:53:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:46,637 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-09-26 21:53:46,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-09-26 21:53:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 21:53:46,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:46,641 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-09-26 21:53:46,641 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:46,641 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-09-26 21:53:46,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:46,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:46,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:46,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:46,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:53:46,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:46,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:46,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:46,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:46,726 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-09-26 21:53:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:47,016 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-09-26 21:53:47,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:47,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-26 21:53:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:47,019 INFO L225 Difference]: With dead ends: 110 [2018-09-26 21:53:47,020 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 21:53:47,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 21:53:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 21:53:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:53:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-09-26 21:53:47,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-09-26 21:53:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:47,050 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-09-26 21:53:47,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-09-26 21:53:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 21:53:47,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:47,052 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-09-26 21:53:47,053 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:47,053 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-09-26 21:53:47,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:47,193 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:47,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:47,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:47,194 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:47,194 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-09-26 21:53:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:47,628 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-09-26 21:53:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:47,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-26 21:53:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:47,630 INFO L225 Difference]: With dead ends: 135 [2018-09-26 21:53:47,630 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 21:53:47,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 21:53:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 21:53:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 21:53:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-09-26 21:53:47,645 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-09-26 21:53:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:47,646 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-09-26 21:53:47,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-09-26 21:53:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 21:53:47,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:47,648 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-09-26 21:53:47,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:47,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-09-26 21:53:47,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:47,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:47,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-26 21:53:47,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:47,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:47,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:47,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:47,727 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-09-26 21:53:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:47,934 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-09-26 21:53:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:47,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-26 21:53:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:47,937 INFO L225 Difference]: With dead ends: 157 [2018-09-26 21:53:47,937 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 21:53:47,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 21:53:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 21:53:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 21:53:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-09-26 21:53:47,952 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-09-26 21:53:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:47,953 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-09-26 21:53:47,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-09-26 21:53:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 21:53:47,954 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:47,955 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-09-26 21:53:47,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:47,955 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-09-26 21:53:47,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:47,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-26 21:53:48,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:48,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:48,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:48,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:48,006 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-09-26 21:53:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:48,214 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-09-26 21:53:48,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:48,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-26 21:53:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:48,216 INFO L225 Difference]: With dead ends: 168 [2018-09-26 21:53:48,216 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 21:53:48,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 21:53:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 21:53:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 21:53:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-09-26 21:53:48,233 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-09-26 21:53:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:48,233 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-09-26 21:53:48,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-09-26 21:53:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 21:53:48,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:48,238 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-09-26 21:53:48,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:48,238 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-09-26 21:53:48,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-26 21:53:48,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:48,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:48,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:48,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:48,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:48,310 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-09-26 21:53:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:48,738 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-09-26 21:53:48,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:48,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-26 21:53:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:48,739 INFO L225 Difference]: With dead ends: 185 [2018-09-26 21:53:48,740 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 21:53:48,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 21:53:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 21:53:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 21:53:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-09-26 21:53:48,767 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-09-26 21:53:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:48,767 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-09-26 21:53:48,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-09-26 21:53:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 21:53:48,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:48,772 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-09-26 21:53:48,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:48,772 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-09-26 21:53:48,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:48,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:48,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-26 21:53:48,867 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:48,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:48,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:48,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:48,868 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-09-26 21:53:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:49,193 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-09-26 21:53:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:49,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-26 21:53:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:49,195 INFO L225 Difference]: With dead ends: 285 [2018-09-26 21:53:49,196 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 21:53:49,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 21:53:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 21:53:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 21:53:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-09-26 21:53:49,224 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-09-26 21:53:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:49,224 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-09-26 21:53:49,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-09-26 21:53:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 21:53:49,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:49,226 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-09-26 21:53:49,227 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:49,227 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-09-26 21:53:49,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:49,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:49,422 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:49,422 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-09-26 21:53:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:49,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:49,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-09-26 21:53:49,843 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:53:49,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:53:49,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:53:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:53:49,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:49,845 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-09-26 21:53:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:52,654 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-09-26 21:53:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:53:52,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-09-26 21:53:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:52,661 INFO L225 Difference]: With dead ends: 695 [2018-09-26 21:53:52,661 INFO L226 Difference]: Without dead ends: 486 [2018-09-26 21:53:52,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-26 21:53:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-09-26 21:53:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-26 21:53:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-09-26 21:53:52,703 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-09-26 21:53:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:52,704 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-09-26 21:53:52,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:53:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-09-26 21:53:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 21:53:52,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:52,706 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-09-26 21:53:52,706 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:52,707 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-09-26 21:53:52,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:52,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-26 21:53:52,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:52,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:52,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:52,807 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-09-26 21:53:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:53,689 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-09-26 21:53:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:53,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-26 21:53:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:53,692 INFO L225 Difference]: With dead ends: 466 [2018-09-26 21:53:53,692 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 21:53:53,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 21:53:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-26 21:53:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 21:53:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-09-26 21:53:53,725 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-09-26 21:53:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:53,725 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-09-26 21:53:53,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-09-26 21:53:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 21:53:53,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:53,727 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-09-26 21:53:53,727 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:53,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-09-26 21:53:53,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-26 21:53:53,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:53,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:53,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:53,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:53,793 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-09-26 21:53:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:53,956 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-09-26 21:53:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-09-26 21:53:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:53,960 INFO L225 Difference]: With dead ends: 464 [2018-09-26 21:53:53,961 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 21:53:53,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 21:53:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-09-26 21:53:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-26 21:53:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-09-26 21:53:54,001 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-09-26 21:53:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:54,002 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-09-26 21:53:54,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-09-26 21:53:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 21:53:54,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:54,003 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-09-26 21:53:54,003 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:54,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-09-26 21:53:54,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:54,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-26 21:53:54,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:54,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:54,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:54,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:54,077 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-09-26 21:53:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:54,345 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-09-26 21:53:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:54,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-26 21:53:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:54,351 INFO L225 Difference]: With dead ends: 548 [2018-09-26 21:53:54,351 INFO L226 Difference]: Without dead ends: 276 [2018-09-26 21:53:54,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-26 21:53:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-09-26 21:53:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-26 21:53:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-09-26 21:53:54,384 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-09-26 21:53:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:54,384 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-09-26 21:53:54,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-09-26 21:53:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 21:53:54,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:54,385 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-09-26 21:53:54,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:54,386 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:54,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-09-26 21:53:54,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:54,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:54,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:54,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:54,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-26 21:53:54,483 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:54,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:54,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:54,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:54,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:54,484 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-09-26 21:53:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:55,775 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-09-26 21:53:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:55,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-09-26 21:53:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:55,779 INFO L225 Difference]: With dead ends: 543 [2018-09-26 21:53:55,779 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 21:53:55,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 21:53:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-09-26 21:53:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-26 21:53:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-09-26 21:53:55,806 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-09-26 21:53:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:55,806 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-09-26 21:53:55,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-09-26 21:53:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 21:53:55,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:55,808 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-09-26 21:53:55,808 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:55,808 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-09-26 21:53:55,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 21:53:55,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:55,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:55,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:55,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:55,901 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-09-26 21:53:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:56,068 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-09-26 21:53:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:56,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-09-26 21:53:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:56,070 INFO L225 Difference]: With dead ends: 543 [2018-09-26 21:53:56,071 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 21:53:56,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 21:53:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 21:53:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 21:53:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-09-26 21:53:56,105 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-09-26 21:53:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:56,106 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-09-26 21:53:56,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-09-26 21:53:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 21:53:56,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:56,107 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-09-26 21:53:56,108 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:56,108 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-09-26 21:53:56,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:56,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-26 21:53:56,214 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:56,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:56,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:56,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:56,215 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-09-26 21:53:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:56,550 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-09-26 21:53:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:56,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-09-26 21:53:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:56,552 INFO L225 Difference]: With dead ends: 576 [2018-09-26 21:53:56,552 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 21:53:56,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 21:53:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 21:53:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 21:53:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-09-26 21:53:56,589 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-09-26 21:53:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:56,589 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-09-26 21:53:56,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-09-26 21:53:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:53:56,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:56,591 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-09-26 21:53:56,592 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:56,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-09-26 21:53:56,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:56,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:56,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:56,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:56,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-26 21:53:56,726 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:56,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:56,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:56,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:56,727 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-09-26 21:53:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:57,021 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-09-26 21:53:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:57,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-09-26 21:53:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:57,026 INFO L225 Difference]: With dead ends: 606 [2018-09-26 21:53:57,026 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 21:53:57,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 21:53:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-26 21:53:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 21:53:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-09-26 21:53:57,074 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-09-26 21:53:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:57,074 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-09-26 21:53:57,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-09-26 21:53:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 21:53:57,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:57,077 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-09-26 21:53:57,077 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:57,077 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-09-26 21:53:57,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-26 21:53:57,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:57,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:57,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:57,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:57,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:57,233 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-09-26 21:53:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:57,487 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-09-26 21:53:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:57,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-09-26 21:53:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:57,490 INFO L225 Difference]: With dead ends: 798 [2018-09-26 21:53:57,490 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 21:53:57,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 21:53:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-26 21:53:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 21:53:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-09-26 21:53:57,559 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-09-26 21:53:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:57,560 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-09-26 21:53:57,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-09-26 21:53:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 21:53:57,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:57,563 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-09-26 21:53:57,563 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:57,563 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-09-26 21:53:57,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:57,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:57,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:57,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-26 21:53:57,780 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:57,780 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-09-26 21:53:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:57,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-09-26 21:53:58,256 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:53:58,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:53:58,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:53:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:53:58,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:58,258 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-09-26 21:53:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:58,547 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-09-26 21:53:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:53:58,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-09-26 21:53:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:58,549 INFO L225 Difference]: With dead ends: 643 [2018-09-26 21:53:58,549 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:58,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:58,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-09-26 21:53:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:58,551 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:58,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:53:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:58,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:58,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:58,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:58,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:00,116 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-26 21:54:00,560 WARN L178 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-26 21:54:01,107 WARN L178 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-26 21:54:01,293 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-26 21:54:01,635 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-26 21:54:01,796 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-09-26 21:54:02,039 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-26 21:54:02,236 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-26 21:54:02,515 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-09-26 21:54:02,840 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-09-26 21:54:02,979 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-09-26 21:54:03,173 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-09-26 21:54:03,493 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-09-26 21:54:03,665 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-26 21:54:03,698 INFO L422 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-09-26 21:54:03,698 INFO L422 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-09-26 21:54:03,698 INFO L422 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-09-26 21:54:03,699 INFO L422 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-09-26 21:54:03,699 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-26 21:54:03,699 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-09-26 21:54:03,699 INFO L422 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-09-26 21:54:03,700 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-09-26 21:54:03,700 INFO L422 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-09-26 21:54:03,700 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-09-26 21:54:03,700 INFO L422 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-09-26 21:54:03,700 INFO L422 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-09-26 21:54:03,700 INFO L422 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-09-26 21:54:03,701 INFO L422 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-09-26 21:54:03,701 INFO L422 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-09-26 21:54:03,701 INFO L422 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-09-26 21:54:03,701 INFO L422 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-09-26 21:54:03,701 INFO L422 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-09-26 21:54:03,702 INFO L422 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-09-26 21:54:03,702 INFO L422 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-09-26 21:54:03,702 INFO L422 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-09-26 21:54:03,702 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-26 21:54:03,702 INFO L422 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-09-26 21:54:03,703 INFO L422 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-09-26 21:54:03,703 INFO L422 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-09-26 21:54:03,723 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:54:03 BoogieIcfgContainer [2018-09-26 21:54:03,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:54:03,725 INFO L168 Benchmark]: Toolchain (without parser) took 19888.33 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 96.5 MB). Free memory was 1.5 GB in the beginning and 986.5 MB in the end (delta: 497.5 MB). Peak memory consumption was 594.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:03,726 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:03,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:03,727 INFO L168 Benchmark]: Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:03,728 INFO L168 Benchmark]: RCFGBuilder took 752.37 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:03,731 INFO L168 Benchmark]: TraceAbstraction took 19021.15 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 96.5 MB). Free memory was 1.5 GB in the beginning and 986.5 MB in the end (delta: 465.8 MB). Peak memory consumption was 562.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:03,736 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 752.37 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19021.15 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 96.5 MB). Free memory was 1.5 GB in the beginning and 986.5 MB in the end (delta: 465.8 MB). Peak memory consumption was 562.2 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, 18.9s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-54-03-755.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-54-03-755.csv Received shutdown request...