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-b2fde6a [2018-09-28 10:37:26,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:37:26,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:37:26,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:37:26,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:37:26,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:37:26,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:37:26,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:37:26,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:37:26,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:37:26,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:37:26,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:37:26,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:37:26,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:37:26,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:37:26,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:37:26,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:37:26,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:37:26,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:37:26,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:37:26,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:37:26,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:37:26,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:37:26,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:37:26,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:37:26,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:37:26,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:37:26,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:37:26,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:37:26,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:37:26,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:37:26,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:37:26,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:37:26,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:37:26,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:37:26,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:37:26,196 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-28 10:37:26,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:37:26,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:37:26,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:37:26,216 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:37:26,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:37:26,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:37:26,217 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:37:26,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:37:26,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:37:26,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:37:26,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:37:26,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:37:26,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:37:26,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:37:26,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:37:26,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:37:26,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:37:26,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:37:26,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:37:26,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:37:26,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:37:26,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:37:26,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:37:26,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:37:26,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:37:26,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:37:26,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:37:26,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:37:26,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:37:26,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:37:26,225 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 10:37:26,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:37:26,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:37:26,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:37:26,291 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:37:26,292 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:37:26,293 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-09-28 10:37:26,293 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-09-28 10:37:26,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:37:26,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:37:26,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:37:26,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:37:26,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:37:26,405 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,434 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:37:26,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:37:26,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:37:26,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:37:26,464 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,465 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,468 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,468 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,488 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,499 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,502 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 28.09 10:37:26" (1/1) ... [2018-09-28 10:37:26,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:37:26,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:37:26,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:37:26,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:37:26,522 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 28.09 10:37:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:37:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:37:26,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:37:27,324 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:37:27,324 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:37:27 BoogieIcfgContainer [2018-09-28 10:37:27,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:37:27,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:37:27,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:37:27,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:37:27,332 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 28.09 10:37:26" (1/2) ... [2018-09-28 10:37:27,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4d456 and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:37:27, skipping insertion in model container [2018-09-28 10:37:27,334 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 28.09 10:37:27" (2/2) ... [2018-09-28 10:37:27,336 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-09-28 10:37:27,348 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:37:27,361 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:37:27,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:37:27,423 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:37:27,424 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:37:27,424 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:37:27,424 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:37:27,424 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:37:27,425 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:37:27,425 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:37:27,425 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:37:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-28 10:37:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:37:27,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:27,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:27,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:27,474 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-28 10:37:27,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:27,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:27,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:27,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:27,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:27,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:27,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:27,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:27,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:27,824 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-28 10:37:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:28,706 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-28 10:37:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:28,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-28 10:37:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:28,722 INFO L225 Difference]: With dead ends: 56 [2018-09-28 10:37:28,722 INFO L226 Difference]: Without dead ends: 34 [2018-09-28 10:37:28,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-28 10:37:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-28 10:37:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-28 10:37:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-28 10:37:28,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-28 10:37:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:28,769 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-28 10:37:28,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-28 10:37:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-28 10:37:28,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:28,770 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:28,771 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:28,771 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-28 10:37:28,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:28,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:28,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:28,867 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:28,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:28,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:28,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:28,873 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-28 10:37:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:29,459 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-28 10:37:29,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:29,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-28 10:37:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:29,462 INFO L225 Difference]: With dead ends: 83 [2018-09-28 10:37:29,463 INFO L226 Difference]: Without dead ends: 50 [2018-09-28 10:37:29,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-28 10:37:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-28 10:37:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-28 10:37:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-28 10:37:29,490 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-28 10:37:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:29,491 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-28 10:37:29,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-28 10:37:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:37:29,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:29,494 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:29,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:29,495 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-28 10:37:29,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:29,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-28 10:37:29,582 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:29,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:29,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:29,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:29,583 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-28 10:37:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:30,169 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-28 10:37:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:30,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-28 10:37:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:30,171 INFO L225 Difference]: With dead ends: 106 [2018-09-28 10:37:30,171 INFO L226 Difference]: Without dead ends: 57 [2018-09-28 10:37:30,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-28 10:37:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-28 10:37:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-28 10:37:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-28 10:37:30,187 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-28 10:37:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:30,187 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-28 10:37:30,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-28 10:37:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:37:30,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:30,191 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-09-28 10:37:30,191 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:30,192 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-28 10:37:30,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:30,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:30,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:30,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:30,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:30,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:30,321 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-28 10:37:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:30,734 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-28 10:37:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:30,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-28 10:37:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:30,739 INFO L225 Difference]: With dead ends: 131 [2018-09-28 10:37:30,739 INFO L226 Difference]: Without dead ends: 74 [2018-09-28 10:37:30,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-28 10:37:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-28 10:37:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-28 10:37:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-28 10:37:30,754 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-28 10:37:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:30,754 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-28 10:37:30,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-28 10:37:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:37:30,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:30,756 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-09-28 10:37:30,757 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:30,757 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-28 10:37:30,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:30,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-28 10:37:30,848 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:30,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:30,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:30,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:30,849 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-28 10:37:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:31,079 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-28 10:37:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:31,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-28 10:37:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:31,081 INFO L225 Difference]: With dead ends: 153 [2018-09-28 10:37:31,082 INFO L226 Difference]: Without dead ends: 80 [2018-09-28 10:37:31,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-28 10:37:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-28 10:37:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-28 10:37:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-28 10:37:31,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-28 10:37:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:31,099 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-28 10:37:31,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-28 10:37:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-28 10:37:31,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:31,101 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-09-28 10:37:31,101 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:31,101 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-28 10:37:31,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-28 10:37:31,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:31,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:31,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:31,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:31,192 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-28 10:37:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:31,437 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-28 10:37:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:31,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-28 10:37:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:31,440 INFO L225 Difference]: With dead ends: 164 [2018-09-28 10:37:31,440 INFO L226 Difference]: Without dead ends: 85 [2018-09-28 10:37:31,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-28 10:37:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-28 10:37:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-28 10:37:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-28 10:37:31,458 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-28 10:37:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:31,458 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-28 10:37:31,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-28 10:37:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-28 10:37:31,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:31,460 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-09-28 10:37:31,460 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:31,461 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-28 10:37:31,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:31,475 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-28 10:37:31,475 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-28 10:37:31,475 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-09-28 10:37:31,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:31,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:37:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-28 10:37:31,896 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:31,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:31,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:31,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:31,897 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-28 10:37:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:32,147 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-28 10:37:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:32,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-28 10:37:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:32,149 INFO L225 Difference]: With dead ends: 246 [2018-09-28 10:37:32,150 INFO L226 Difference]: Without dead ends: 162 [2018-09-28 10:37:32,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-28 10:37:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-28 10:37:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-28 10:37:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-28 10:37:32,178 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-28 10:37:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:32,178 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-28 10:37:32,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-28 10:37:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-28 10:37:32,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:32,181 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-09-28 10:37:32,181 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:32,182 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-28 10:37:32,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-28 10:37:32,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:32,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:32,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:32,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:32,269 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-28 10:37:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:32,805 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-28 10:37:32,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:32,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-28 10:37:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:32,808 INFO L225 Difference]: With dead ends: 250 [2018-09-28 10:37:32,808 INFO L226 Difference]: Without dead ends: 166 [2018-09-28 10:37:32,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-28 10:37:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-28 10:37:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-28 10:37:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-28 10:37:32,845 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-28 10:37:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:32,845 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-28 10:37:32,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-28 10:37:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-28 10:37:32,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:32,855 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-09-28 10:37:32,855 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:32,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-28 10:37:32,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-28 10:37:33,052 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:37:33,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 10:37:33,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:33,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:37:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-28 10:37:33,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-28 10:37:33,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-28 10:37:33,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 10:37:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 10:37:33,537 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:33,537 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-28 10:37:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:36,777 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-28 10:37:36,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 10:37:36,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-28 10:37:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:36,780 INFO L225 Difference]: With dead ends: 598 [2018-09-28 10:37:36,780 INFO L226 Difference]: Without dead ends: 406 [2018-09-28 10:37:36,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-28 10:37:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-28 10:37:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-28 10:37:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-28 10:37:36,821 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-28 10:37:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:36,821 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-28 10:37:36,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 10:37:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-28 10:37:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-28 10:37:36,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:36,823 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-09-28 10:37:36,824 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:36,825 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-28 10:37:36,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:36,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-28 10:37:36,894 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:36,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:36,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:36,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:36,895 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-28 10:37:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:37,170 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-28 10:37:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:37,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-28 10:37:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:37,172 INFO L225 Difference]: With dead ends: 399 [2018-09-28 10:37:37,172 INFO L226 Difference]: Without dead ends: 239 [2018-09-28 10:37:37,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-28 10:37:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-28 10:37:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-28 10:37:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-28 10:37:37,201 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-28 10:37:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:37,202 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-28 10:37:37,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-28 10:37:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-28 10:37:37,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:37,203 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-09-28 10:37:37,203 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:37,203 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-28 10:37:37,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:37,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-28 10:37:37,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:37,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:37,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:37,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:37,314 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-28 10:37:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:37,814 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-28 10:37:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:37,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-28 10:37:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:37,823 INFO L225 Difference]: With dead ends: 470 [2018-09-28 10:37:37,823 INFO L226 Difference]: Without dead ends: 237 [2018-09-28 10:37:37,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-28 10:37:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-28 10:37:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-28 10:37:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-28 10:37:37,849 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-28 10:37:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:37,850 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-28 10:37:37,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-28 10:37:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-28 10:37:37,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:37,851 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-09-28 10:37:37,851 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:37,852 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-28 10:37:37,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-28 10:37:37,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:37,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:37,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:37,953 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-28 10:37:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:38,213 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-28 10:37:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:38,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-28 10:37:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:38,216 INFO L225 Difference]: With dead ends: 465 [2018-09-28 10:37:38,216 INFO L226 Difference]: Without dead ends: 235 [2018-09-28 10:37:38,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-28 10:37:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-28 10:37:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-28 10:37:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-28 10:37:38,241 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-28 10:37:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:38,241 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-28 10:37:38,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-28 10:37:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-28 10:37:38,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:38,243 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-09-28 10:37:38,243 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:38,243 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-28 10:37:38,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-28 10:37:38,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:38,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:38,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:38,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:38,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:38,349 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-28 10:37:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:38,619 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-28 10:37:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:38,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-28 10:37:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:38,622 INFO L225 Difference]: With dead ends: 465 [2018-09-28 10:37:38,622 INFO L226 Difference]: Without dead ends: 238 [2018-09-28 10:37:38,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-28 10:37:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-28 10:37:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-28 10:37:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-28 10:37:38,647 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-28 10:37:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:38,648 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-28 10:37:38,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-28 10:37:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-28 10:37:38,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:38,649 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-09-28 10:37:38,650 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:38,650 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-28 10:37:38,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:38,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:38,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:38,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-28 10:37:38,775 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:38,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:38,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:38,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:38,776 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-28 10:37:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:39,631 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-28 10:37:39,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:39,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-28 10:37:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:39,633 INFO L225 Difference]: With dead ends: 498 [2018-09-28 10:37:39,633 INFO L226 Difference]: Without dead ends: 268 [2018-09-28 10:37:39,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-28 10:37:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-28 10:37:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-28 10:37:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-28 10:37:39,662 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-28 10:37:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:39,662 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-28 10:37:39,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-28 10:37:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-28 10:37:39,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:39,664 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-09-28 10:37:39,664 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:39,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-28 10:37:39,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:39,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-09-28 10:37:39,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:39,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:39,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:39,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:39,763 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-28 10:37:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:40,107 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-28 10:37:40,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:40,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-28 10:37:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:40,109 INFO L225 Difference]: With dead ends: 561 [2018-09-28 10:37:40,109 INFO L226 Difference]: Without dead ends: 301 [2018-09-28 10:37:40,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-28 10:37:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-28 10:37:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-28 10:37:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-28 10:37:40,143 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-28 10:37:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:40,143 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-28 10:37:40,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-28 10:37:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-28 10:37:40,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:40,145 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-09-28 10:37:40,145 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:40,145 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-28 10:37:40,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:40,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-28 10:37:40,270 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:40,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:40,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:40,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:40,271 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-28 10:37:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:40,511 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-28 10:37:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:40,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-28 10:37:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:40,514 INFO L225 Difference]: With dead ends: 397 [2018-09-28 10:37:40,514 INFO L226 Difference]: Without dead ends: 395 [2018-09-28 10:37:40,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-28 10:37:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-28 10:37:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-28 10:37:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-28 10:37:40,556 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-28 10:37:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:40,556 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-28 10:37:40,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-28 10:37:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-28 10:37:40,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:40,558 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-09-28 10:37:40,559 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:40,559 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-28 10:37:40,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:40,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:40,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:40,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:40,575 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-28 10:37:40,576 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-28 10:37:40,576 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-09-28 10:37:40,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:40,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:37:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-09-28 10:37:41,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:41,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:41,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:41,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:41,173 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-28 10:37:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:41,593 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-28 10:37:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:41,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-28 10:37:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:41,595 INFO L225 Difference]: With dead ends: 782 [2018-09-28 10:37:41,595 INFO L226 Difference]: Without dead ends: 395 [2018-09-28 10:37:41,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-28 10:37:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-28 10:37:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-28 10:37:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-28 10:37:41,643 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-28 10:37:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:41,644 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-28 10:37:41,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-28 10:37:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-28 10:37:41,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:41,646 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-09-28 10:37:41,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:41,646 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-28 10:37:41,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-28 10:37:41,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:37:41,842 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-09-28 10:37:41,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:41,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:37:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-28 10:37:42,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:37:42,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-28 10:37:42,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:37:42,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:37:42,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:42,091 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-28 10:37:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:42,294 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-28 10:37:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 10:37:42,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-28 10:37:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:42,295 INFO L225 Difference]: With dead ends: 629 [2018-09-28 10:37:42,295 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:37:42,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:37:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:37:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:37:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:37:42,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-28 10:37:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:42,297 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:37:42,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:37:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:37:42,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:37:42,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:37:42,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:42,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:43,449 WARN L178 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-28 10:37:43,699 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-28 10:37:44,039 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-28 10:37:44,212 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-28 10:37:44,332 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-09-28 10:37:44,439 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-28 10:37:44,674 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-28 10:37:45,058 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-28 10:37:45,189 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-28 10:37:45,314 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-28 10:37:45,443 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-28 10:37:45,559 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-28 10:37:45,644 INFO L422 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-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,645 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-09-28 10:37:45,645 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,645 INFO L422 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-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,646 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-09-28 10:37:45,646 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,646 INFO L422 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-09-28 10:37:45,647 INFO L422 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-09-28 10:37:45,647 INFO L422 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-09-28 10:37:45,647 INFO L422 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-09-28 10:37:45,647 INFO L422 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-09-28 10:37:45,647 INFO L422 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-09-28 10:37:45,647 INFO L422 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-09-28 10:37:45,664 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:37:45 BoogieIcfgContainer [2018-09-28 10:37:45,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:37:45,665 INFO L168 Benchmark]: Toolchain (without parser) took 19284.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 265.0 MB). Peak memory consumption was 408.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:45,666 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:37:45,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:37:45,667 INFO L168 Benchmark]: Boogie Preprocessor took 60.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:37:45,668 INFO L168 Benchmark]: RCFGBuilder took 807.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:45,669 INFO L168 Benchmark]: TraceAbstraction took 18338.61 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 233.3 MB). Peak memory consumption was 377.0 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:45,673 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 807.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18338.61 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 143.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 233.3 MB). Peak memory consumption was 377.0 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, 18.2s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s 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-09-28_10-37-45-691.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-09-28_10-37-45-691.csv Received shutdown request...