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_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:41,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:41,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:41,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:41,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:41,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:41,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:41,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:41,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:41,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:41,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:41,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:41,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:41,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:41,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:41,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:41,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:41,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:41,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:41,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:41,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:41,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:41,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:41,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:41,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:41,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:41,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:41,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:41,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:41,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:41,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:41,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:41,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:41,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:41,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:41,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:41,119 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:41,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:41,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:41,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:41,139 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:41,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:41,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:41,140 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:41,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:41,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:41,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:41,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:41,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:41,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:41,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:41,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:41,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:41,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:41,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:41,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:41,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:41,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:41,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:41,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:41,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:41,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:41,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:41,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:41,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:41,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:41,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:41,145 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:41,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:41,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:41,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:41,235 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:41,236 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:41,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-02 12:16:41,240 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl' [2018-10-02 12:16:41,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:41,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:41,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:41,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:41,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:41,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:41,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:41,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:41,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:41,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/1) ... [2018-10-02 12:16:41,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:41,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:41,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:41,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:41,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (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:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:41,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:42,160 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:42,161 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:42 BoogieIcfgContainer [2018-10-02 12:16:42,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:42,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:42,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:42,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:42,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:41" (1/2) ... [2018-10-02 12:16:42,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465dbe5e and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:42, skipping insertion in model container [2018-10-02 12:16:42,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:42" (2/2) ... [2018-10-02 12:16:42,169 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-02 12:16:42,178 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:42,187 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:42,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:42,237 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:42,237 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:42,238 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:42,238 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:42,238 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:42,238 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:42,238 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:42,238 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-02 12:16:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:42,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:42,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:42,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:42,270 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-02 12:16:42,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:42,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,512 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:42,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:42,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:42,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:42,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,535 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-02 12:16:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,489 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-02 12:16:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:43,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 12:16:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,507 INFO L225 Difference]: With dead ends: 56 [2018-10-02 12:16:43,507 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 12:16:43,511 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:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 12:16:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 12:16:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 12:16:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-02 12:16:43,551 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-02 12:16:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,551 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-02 12:16:43,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-02 12:16:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 12:16:43,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:43,554 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:43,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:43,555 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-02 12:16:43,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:43,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:43,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:43,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,695 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-02 12:16:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:44,122 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-02 12:16:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:44,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-02 12:16:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:44,126 INFO L225 Difference]: With dead ends: 83 [2018-10-02 12:16:44,126 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 12:16:44,127 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:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 12:16:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 12:16:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 12:16:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-02 12:16:44,141 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-02 12:16:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-02 12:16:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-02 12:16:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:16:44,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:44,143 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:44,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:44,144 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-02 12:16:44,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:44,211 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:44,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:44,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:44,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:44,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:44,213 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-02 12:16:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:44,819 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-02 12:16:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:44,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 12:16:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:44,824 INFO L225 Difference]: With dead ends: 106 [2018-10-02 12:16:44,824 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 12:16:44,825 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:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 12:16:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 12:16:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 12:16:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-02 12:16:44,852 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-02 12:16:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:44,855 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-02 12:16:44,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-02 12:16:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:16:44,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:44,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:44,857 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:44,857 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-02 12:16:44,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:45,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:45,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:45,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:45,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:45,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:45,013 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-02 12:16:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:45,447 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-02 12:16:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:45,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 12:16:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:45,449 INFO L225 Difference]: With dead ends: 131 [2018-10-02 12:16:45,449 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 12:16:45,450 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:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 12:16:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-02 12:16:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-02 12:16:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-02 12:16:45,465 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-02 12:16:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:45,465 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-02 12:16:45,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-02 12:16:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 12:16:45,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:45,468 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:45,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:45,468 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-02 12:16:45,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:45,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-02 12:16:45,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:45,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:45,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:45,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:45,529 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-02 12:16:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:45,757 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-02 12:16:45,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:45,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-02 12:16:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:45,759 INFO L225 Difference]: With dead ends: 153 [2018-10-02 12:16:45,760 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 12:16:45,761 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:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 12:16:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-02 12:16:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-02 12:16:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-02 12:16:45,776 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-02 12:16:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:45,777 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-02 12:16:45,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-02 12:16:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 12:16:45,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:45,779 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] [2018-10-02 12:16:45,779 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:45,779 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-02 12:16:45,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:45,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:45,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:45,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-02 12:16:45,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:45,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:45,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:45,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:45,828 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-02 12:16:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:46,039 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-02 12:16:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:46,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 12:16:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:46,042 INFO L225 Difference]: With dead ends: 164 [2018-10-02 12:16:46,042 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 12:16:46,044 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:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 12:16:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 12:16:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 12:16:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-02 12:16:46,059 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-02 12:16:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:46,059 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-02 12:16:46,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-02 12:16:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 12:16:46,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,062 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] [2018-10-02 12:16:46,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,062 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-02 12:16:46,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,076 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 12:16:46,076 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 12:16:46,076 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-02 12:16:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-02 12:16:46,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:46,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,257 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-02 12:16:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:46,708 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-02 12:16:46,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:46,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 12:16:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:46,711 INFO L225 Difference]: With dead ends: 246 [2018-10-02 12:16:46,712 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 12:16:46,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 12:16:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-02 12:16:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 12:16:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-02 12:16:46,741 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-02 12:16:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:46,741 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-02 12:16:46,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-02 12:16:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-02 12:16:46,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,744 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:46,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,745 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-02 12:16:46,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 12:16:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:46,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,840 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-02 12:16:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:47,362 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-02 12:16:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:47,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-02 12:16:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:47,370 INFO L225 Difference]: With dead ends: 250 [2018-10-02 12:16:47,371 INFO L226 Difference]: Without dead ends: 166 [2018-10-02 12:16:47,371 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:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-02 12:16:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-02 12:16:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-02 12:16:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-02 12:16:47,403 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-02 12:16:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:47,403 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-02 12:16:47,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-02 12:16:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 12:16:47,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:47,408 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] [2018-10-02 12:16:47,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:47,408 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-02 12:16:47,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:47,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 12:16:47,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:47,666 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) [2018-10-02 12:16:47,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:47,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 12:16:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:16:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 12:16:48,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:16:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:16:48,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:48,483 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-02 12:16:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:51,326 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-02 12:16:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:16:51,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-02 12:16:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:51,329 INFO L225 Difference]: With dead ends: 598 [2018-10-02 12:16:51,329 INFO L226 Difference]: Without dead ends: 406 [2018-10-02 12:16:51,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.2s impTime [2018-10-02 12:16:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-02 12:16:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-02 12:16:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-02 12:16:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-02 12:16:51,366 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-02 12:16:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:51,366 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-02 12:16:51,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:16:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-02 12:16:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-02 12:16:51,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:51,368 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:51,368 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:51,369 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-02 12:16:51,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:51,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:51,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-02 12:16:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:51,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:51,436 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-02 12:16:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:51,736 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-02 12:16:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:51,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-02 12:16:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:51,739 INFO L225 Difference]: With dead ends: 399 [2018-10-02 12:16:51,739 INFO L226 Difference]: Without dead ends: 239 [2018-10-02 12:16:51,740 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:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-02 12:16:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-02 12:16:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-02 12:16:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-02 12:16:51,768 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-02 12:16:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:51,769 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-02 12:16:51,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-02 12:16:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-02 12:16:51,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:51,770 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:51,771 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:51,771 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-02 12:16:51,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:51,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:51,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-02 12:16:51,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:51,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:51,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:51,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:51,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:51,818 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-02 12:16:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:52,076 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-02 12:16:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:52,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-02 12:16:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:52,078 INFO L225 Difference]: With dead ends: 470 [2018-10-02 12:16:52,078 INFO L226 Difference]: Without dead ends: 237 [2018-10-02 12:16:52,079 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:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-02 12:16:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-02 12:16:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-02 12:16:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-02 12:16:52,107 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-02 12:16:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:52,108 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-02 12:16:52,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-02 12:16:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-02 12:16:52,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:52,109 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:52,110 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:52,110 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-02 12:16:52,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:52,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 12:16:52,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:52,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:52,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:52,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:52,214 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:52,214 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-02 12:16:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:52,672 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-02 12:16:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:52,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-02 12:16:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:52,675 INFO L225 Difference]: With dead ends: 465 [2018-10-02 12:16:52,675 INFO L226 Difference]: Without dead ends: 235 [2018-10-02 12:16:52,675 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:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-02 12:16:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-02 12:16:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-02 12:16:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-02 12:16:52,702 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-02 12:16:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:52,702 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-02 12:16:52,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-02 12:16:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-02 12:16:52,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:52,703 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:52,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:52,704 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:52,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-02 12:16:52,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:52,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:52,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:52,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:52,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-02 12:16:52,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:52,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:52,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:52,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:52,812 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:52,812 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-02 12:16:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:53,186 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-02 12:16:53,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:53,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-02 12:16:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:53,188 INFO L225 Difference]: With dead ends: 465 [2018-10-02 12:16:53,188 INFO L226 Difference]: Without dead ends: 238 [2018-10-02 12:16:53,189 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:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-02 12:16:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-02 12:16:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-02 12:16:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-02 12:16:53,214 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-02 12:16:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:53,215 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-02 12:16:53,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-02 12:16:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 12:16:53,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:53,216 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:53,216 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:53,216 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-02 12:16:53,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:53,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:53,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-02 12:16:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:53,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:53,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:53,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:53,335 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-02 12:16:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:54,666 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-02 12:16:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:54,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-02 12:16:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:54,669 INFO L225 Difference]: With dead ends: 498 [2018-10-02 12:16:54,669 INFO L226 Difference]: Without dead ends: 268 [2018-10-02 12:16:54,670 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:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-02 12:16:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-02 12:16:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 12:16:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-02 12:16:54,696 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-02 12:16:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:54,697 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-02 12:16:54,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-02 12:16:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 12:16:54,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:54,698 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:54,698 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:54,699 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-02 12:16:54,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-02 12:16:54,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:54,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:54,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:54,816 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-02 12:16:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:55,098 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-02 12:16:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:55,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-02 12:16:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:55,100 INFO L225 Difference]: With dead ends: 561 [2018-10-02 12:16:55,100 INFO L226 Difference]: Without dead ends: 301 [2018-10-02 12:16:55,100 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:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-02 12:16:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-02 12:16:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 12:16:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-02 12:16:55,136 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-02 12:16:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-02 12:16:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-02 12:16:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-02 12:16:55,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:55,138 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] [2018-10-02 12:16:55,138 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:55,138 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-02 12:16:55,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:55,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:55,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:55,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-02 12:16:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:55,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:55,283 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-02 12:16:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:55,990 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-02 12:16:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:55,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-02 12:16:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:55,993 INFO L225 Difference]: With dead ends: 397 [2018-10-02 12:16:55,993 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 12:16:55,994 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:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 12:16:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 12:16:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 12:16:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-02 12:16:56,036 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-02 12:16:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:56,037 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-02 12:16:56,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-02 12:16:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-02 12:16:56,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:56,039 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:56,039 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:56,040 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-02 12:16:56,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,060 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 12:16:56,060 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 12:16:56,060 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-02 12:16:56,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:56,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-10-02 12:16:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:56,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:56,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:56,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:56,437 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-02 12:16:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:56,631 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-02 12:16:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:56,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-02 12:16:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:56,634 INFO L225 Difference]: With dead ends: 782 [2018-10-02 12:16:56,634 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 12:16:56,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:16:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 12:16:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 12:16:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 12:16:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-02 12:16:56,687 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-02 12:16:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:56,687 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-02 12:16:56,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-02 12:16:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-02 12:16:56,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:56,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:56,691 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:56,691 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-02 12:16:56,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 12:16:56,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:56,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:57,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 12:16:57,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:57,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:16:57,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:57,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:57,175 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-02 12:16:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:57,426 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-02 12:16:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:16:57,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-02 12:16:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:57,427 INFO L225 Difference]: With dead ends: 629 [2018-10-02 12:16:57,427 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:57,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:16:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:57,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-02 12:16:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:57,429 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:57,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:57,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:57,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:57,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:57,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,113 WARN L178 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-02 12:16:59,427 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:16:59,668 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-02 12:16:59,783 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-02 12:16:59,982 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-02 12:17:00,217 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-02 12:17:00,505 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-02 12:17:00,961 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:17:01,096 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:17:01,293 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 386) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:01,293 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 436) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L478(lines 263 478) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,294 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-10-02 12:17:01,294 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L412(lines 412 423) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 413) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L272(lines 235 272) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,294 INFO L421 ceAbstractionStarter]: At program point L268(lines 268 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,295 INFO L421 ceAbstractionStarter]: At program point L458(lines 455 473) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:01,295 INFO L421 ceAbstractionStarter]: At program point L425(lines 422 444) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:01,295 INFO L421 ceAbstractionStarter]: At program point L322(lines 322 339) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-02 12:17:01,295 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-10-02 12:17:01,295 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-10-02 12:17:01,295 INFO L421 ceAbstractionStarter]: At program point L248(lines 248 264) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,295 INFO L421 ceAbstractionStarter]: At program point L389(lines 389 401) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L290(lines 290 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L443(lines 443 469) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L344(lines 344 352) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 456) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:01,296 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 319) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-02 12:17:01,315 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:17:01 BoogieIcfgContainer [2018-10-02 12:17:01,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:17:01,316 INFO L168 Benchmark]: Toolchain (without parser) took 19977.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.6 MB). Peak memory consumption was 407.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:01,318 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:01,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:01,319 INFO L168 Benchmark]: Boogie Preprocessor took 44.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:01,319 INFO L168 Benchmark]: RCFGBuilder took 713.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:01,320 INFO L168 Benchmark]: TraceAbstraction took 19153.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 259.0 MB). Peak memory consumption was 377.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:01,325 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.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 713.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19153.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 259.0 MB). Peak memory consumption was 377.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 480]: 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~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 19.0s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2046 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 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_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-17-01-343.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-17-01-343.csv Received shutdown request...