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_2.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:40,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:40,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:40,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:40,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:40,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:40,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:40,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:40,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:40,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:40,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:40,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:40,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:40,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:40,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:40,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:40,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:40,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:40,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:40,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:40,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:40,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:40,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:40,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:40,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:40,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:40,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:40,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:40,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:40,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:40,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:40,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:40,103 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:40,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:40,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:40,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:40,105 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-10-02 12:16:40,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:40,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:40,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:40,126 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:40,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:40,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:40,127 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:40,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:40,128 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:40,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:40,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:40,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:40,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:40,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:40,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:40,130 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:40,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:40,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:40,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:40,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:40,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:40,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:40,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:40,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:40,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:40,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:40,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:40,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:40,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:40,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:40,134 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:40,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:40,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:40,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:40,214 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:40,214 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:40,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl [2018-10-02 12:16:40,215 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl' [2018-10-02 12:16:40,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:40,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:40,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:40,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:40,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:40,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:40,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:40,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:40,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:40,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... [2018-10-02 12:16:40,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:40,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:40,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:40,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:40,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:40,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:41,179 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:41,180 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:41 BoogieIcfgContainer [2018-10-02 12:16:41,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:41,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:41,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:41,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:41,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:40" (1/2) ... [2018-10-02 12:16:41,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea391fb and model type s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:41, skipping insertion in model container [2018-10-02 12:16:41,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:41" (2/2) ... [2018-10-02 12:16:41,189 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil.c_16.bpl [2018-10-02 12:16:41,199 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:41,208 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:41,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:41,260 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:41,260 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:41,260 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:41,260 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:41,260 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:41,261 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:41,261 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:41,261 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-02 12:16:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:16:41,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:41,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:41,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:41,301 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash 212232665, now seen corresponding path program 1 times [2018-10-02 12:16:41,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:41,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:41,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:41,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:41,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:41,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:41,607 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-02 12:16:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:41,817 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2018-10-02 12:16:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:41,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-02 12:16:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:41,833 INFO L225 Difference]: With dead ends: 31 [2018-10-02 12:16:41,834 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 12:16:41,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 12:16:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 12:16:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 12:16:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-02 12:16:41,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 8 [2018-10-02 12:16:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:41,877 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-02 12:16:41,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-02 12:16:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:16:41,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:41,878 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:41,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:41,879 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash -250815183, now seen corresponding path program 1 times [2018-10-02 12:16:41,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:41,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:42,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:42,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:42,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:42,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,025 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2018-10-02 12:16:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:42,306 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2018-10-02 12:16:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:42,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-02 12:16:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:42,309 INFO L225 Difference]: With dead ends: 33 [2018-10-02 12:16:42,309 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 12:16:42,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 12:16:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 12:16:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 12:16:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-02 12:16:42,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2018-10-02 12:16:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:42,319 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-02 12:16:42,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-02 12:16:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:42,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:42,321 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:42,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:42,322 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1316450759, now seen corresponding path program 1 times [2018-10-02 12:16:42,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:16:42,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:42,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,451 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-02 12:16:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:42,658 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-10-02 12:16:42,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:42,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 12:16:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:42,660 INFO L225 Difference]: With dead ends: 43 [2018-10-02 12:16:42,661 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 12:16:42,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 12:16:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 12:16:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 12:16:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-02 12:16:42,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-02 12:16:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:42,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-02 12:16:42,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-02 12:16:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:16:42,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:42,670 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:42,670 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:42,670 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 494540425, now seen corresponding path program 1 times [2018-10-02 12:16:42,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:42,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:16:42,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:42,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:42,782 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,783 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 3 states. [2018-10-02 12:16:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:42,949 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-10-02 12:16:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:42,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-02 12:16:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:42,951 INFO L225 Difference]: With dead ends: 45 [2018-10-02 12:16:42,951 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:16:42,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:16:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-02 12:16:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-02 12:16:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-10-02 12:16:42,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 25 [2018-10-02 12:16:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:42,962 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-10-02 12:16:42,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-10-02 12:16:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:16:42,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:42,964 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:42,964 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:42,964 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1892631291, now seen corresponding path program 1 times [2018-10-02 12:16:42,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:42,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:42,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 12:16:43,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:43,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,062 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2018-10-02 12:16:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,139 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-10-02 12:16:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:43,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-02 12:16:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,141 INFO L225 Difference]: With dead ends: 82 [2018-10-02 12:16:43,141 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:16:43,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:16:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-02 12:16:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 12:16:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-10-02 12:16:43,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 25 [2018-10-02 12:16:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-10-02 12:16:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-10-02 12:16:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:16:43,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:43,153 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:43,153 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:43,154 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1225606051, now seen corresponding path program 1 times [2018-10-02 12:16:43,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-02 12:16:43,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:43,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,278 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 3 states. [2018-10-02 12:16:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,727 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-10-02 12:16:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:43,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-02 12:16:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,730 INFO L225 Difference]: With dead ends: 95 [2018-10-02 12:16:43,730 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 12:16:43,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 12:16:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-02 12:16:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-02 12:16:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-02 12:16:43,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 39 [2018-10-02 12:16:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,742 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-02 12:16:43,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-02 12:16:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 12:16:43,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:43,743 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:43,744 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:43,744 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2017163281, now seen corresponding path program 1 times [2018-10-02 12:16:43,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:16:43,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:43,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,845 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 3 states. [2018-10-02 12:16:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:44,087 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2018-10-02 12:16:44,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:44,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-02 12:16:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:44,089 INFO L225 Difference]: With dead ends: 119 [2018-10-02 12:16:44,089 INFO L226 Difference]: Without dead ends: 65 [2018-10-02 12:16:44,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-02 12:16:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-02 12:16:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-02 12:16:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-10-02 12:16:44,104 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 46 [2018-10-02 12:16:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:44,105 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-10-02 12:16:44,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-10-02 12:16:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-02 12:16:44,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:44,107 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:44,107 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:44,108 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1034165711, now seen corresponding path program 1 times [2018-10-02 12:16:44,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:44,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:16:44,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:44,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:44,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:16:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:16:44,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:44,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:44,825 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 4 states. [2018-10-02 12:16:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:45,649 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-10-02 12:16:45,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:16:45,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-02 12:16:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:45,651 INFO L225 Difference]: With dead ends: 106 [2018-10-02 12:16:45,652 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:45,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime [2018-10-02 12:16:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:45,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-10-02 12:16:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:45,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:45,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:45,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:45,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:46,020 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-02 12:16:46,545 WARN L178 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-10-02 12:16:46,892 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-02 12:16:47,090 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-10-02 12:16:47,108 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse1 .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 12:16:47,109 INFO L421 ceAbstractionStarter]: At program point L383(lines 383 398) the Hoare annotation is: false [2018-10-02 12:16:47,109 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 400) no Hoare annotation was computed. [2018-10-02 12:16:47,109 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 400) no Hoare annotation was computed. [2018-10-02 12:16:47,109 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 399) no Hoare annotation was computed. [2018-10-02 12:16:47,109 INFO L421 ceAbstractionStarter]: At program point L326(lines 321 345) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) [2018-10-02 12:16:47,110 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 400) no Hoare annotation was computed. [2018-10-02 12:16:47,110 INFO L421 ceAbstractionStarter]: At program point L368(lines 368 384) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-02 12:16:47,110 INFO L421 ceAbstractionStarter]: At program point L397(lines 286 397) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 12:16:47,110 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 375) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-02 12:16:47,110 INFO L421 ceAbstractionStarter]: At program point L315(lines 315 334) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 12:16:47,110 INFO L421 ceAbstractionStarter]: At program point L377(lines 374 392) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-02 12:16:47,111 INFO L421 ceAbstractionStarter]: At program point L344(lines 344 361) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5) .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448))) [2018-10-02 12:16:47,111 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 322) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1)) [2018-10-02 12:16:47,111 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse1 .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 12:16:47,111 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 304) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)))) [2018-10-02 12:16:47,124 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:16:47 BoogieIcfgContainer [2018-10-02 12:16:47,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:16:47,125 INFO L168 Benchmark]: Toolchain (without parser) took 6833.47 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 298.7 MB). Peak memory consumption was 298.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:47,126 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-10-02 12:16:47,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 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-10-02 12:16:47,128 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 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-10-02 12:16:47,129 INFO L168 Benchmark]: RCFGBuilder took 807.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:47,130 INFO L168 Benchmark]: TraceAbstraction took 5942.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:47,136 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.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.27 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 31.95 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 807.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5942.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 399]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ssl3_accept_~s__state~5 == 8496 && ssl3_accept_~blastFlag~5 == 1 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || ssl3_accept_~s__state~5 <= 8448 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: ((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 32 SDslu, 67 SDs, 0 SdLazy, 125 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 57 NumberOfFragments, 281 HoareAnnotationTreeSize, 12 FomulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 13414 SizeOfPredicates, 2 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 429/437 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_2.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-16-47-154.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-16-47-154.csv Received shutdown request...