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_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:55,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:55,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:55,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:55,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:55,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:55,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:55,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:55,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:55,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:55,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:55,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:55,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:55,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:55,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:55,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:55,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:55,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:55,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:55,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:55,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:55,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:55,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:55,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:55,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:55,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:55,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:55,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:55,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:55,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:55,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:55,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:55,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:55,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:55,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:55,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:55,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:53:55,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:55,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:55,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:55,652 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:55,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:55,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:55,653 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:55,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:55,654 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:55,654 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:55,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:55,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:55,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:55,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:55,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:55,655 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:55,656 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:55,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:55,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:55,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:55,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:55,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:55,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:55,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:55,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:55,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:55,658 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:55,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:55,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:55,659 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:55,659 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:55,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:55,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:55,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:55,737 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:55,738 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:55,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-26 21:53:55,739 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-09-26 21:53:55,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:55,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:55,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:55,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:55,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:55,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:55,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:55,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:55,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:55,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... [2018-09-26 21:53:55,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:55,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:55,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:55,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:55,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:56,874 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:56,875 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:56 BoogieIcfgContainer [2018-09-26 21:53:56,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:56,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:56,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:56,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:56,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:55" (1/2) ... [2018-09-26 21:53:56,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75efba6f and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:56, skipping insertion in model container [2018-09-26 21:53:56,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:56" (2/2) ... [2018-09-26 21:53:56,882 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-26 21:53:56,890 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:56,899 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:56,942 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:56,943 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:56,943 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:56,943 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:56,943 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:56,943 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:56,944 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:56,944 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:56,944 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-26 21:53:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:56,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:56,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:56,970 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:56,978 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-26 21:53:56,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:57,238 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:57,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:57,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:57,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:57,258 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-26 21:53:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:58,153 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-26 21:53:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:58,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:53:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:58,174 INFO L225 Difference]: With dead ends: 56 [2018-09-26 21:53:58,175 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:53:58,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:53:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 21:53:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 21:53:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-26 21:53:58,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-26 21:53:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:58,222 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-26 21:53:58,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-26 21:53:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 21:53:58,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:58,224 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:58,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:58,225 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-26 21:53:58,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:58,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:58,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:58,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:58,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:58,317 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:58,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:58,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:58,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:58,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:58,320 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-26 21:53:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:59,002 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-26 21:53:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:59,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-26 21:53:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:59,005 INFO L225 Difference]: With dead ends: 83 [2018-09-26 21:53:59,005 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:53:59,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:53:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 21:53:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 21:53:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-26 21:53:59,023 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-26 21:53:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:59,024 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-26 21:53:59,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-26 21:53:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:53:59,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:59,026 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-26 21:53:59,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:59,026 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-26 21:53:59,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:59,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:59,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:53:59,138 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:59,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:59,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:59,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:59,139 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-26 21:53:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:59,609 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-26 21:53:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:53:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:59,612 INFO L225 Difference]: With dead ends: 106 [2018-09-26 21:53:59,612 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 21:53:59,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 21:53:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 21:53:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 21:53:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-26 21:53:59,626 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-26 21:53:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:59,626 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-26 21:53:59,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-26 21:53:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:53:59,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:59,628 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-26 21:53:59,628 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:59,629 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-26 21:53:59,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:59,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:59,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:59,742 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:59,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:59,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:59,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:59,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:59,743 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-26 21:54:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:00,195 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-26 21:54:00,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:00,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:54:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:00,197 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:54:00,197 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 21:54:00,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 21:54:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 21:54:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 21:54:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-26 21:54:00,218 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-26 21:54:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:00,218 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-26 21:54:00,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-26 21:54:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:54:00,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:00,220 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-26 21:54:00,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:00,220 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-26 21:54:00,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:00,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-26 21:54:00,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:00,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:00,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:00,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:00,326 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-26 21:54:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:00,593 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-26 21:54:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:00,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-26 21:54:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:00,595 INFO L225 Difference]: With dead ends: 153 [2018-09-26 21:54:00,596 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 21:54:00,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 21:54:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 21:54:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 21:54:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-26 21:54:00,612 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-26 21:54:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:00,612 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-26 21:54:00,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-26 21:54:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 21:54:00,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:00,614 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-26 21:54:00,615 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:00,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-26 21:54:00,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:00,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:00,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-26 21:54:00,697 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:00,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:00,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:00,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:00,698 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-26 21:54:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:00,942 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-26 21:54:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:00,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-26 21:54:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:00,946 INFO L225 Difference]: With dead ends: 164 [2018-09-26 21:54:00,946 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 21:54:00,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 21:54:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 21:54:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:54:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-26 21:54:00,963 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-26 21:54:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:00,963 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-26 21:54:00,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-26 21:54:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:54:00,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:00,965 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-26 21:54:00,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:00,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-26 21:54:00,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:00,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:00,988 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-26 21:54:00,988 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-26 21:54:00,988 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-26 21:54:01,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:01,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-26 21:54:01,373 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:01,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:01,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:01,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:01,375 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-26 21:54:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:01,642 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-26 21:54:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:01,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 21:54:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:01,645 INFO L225 Difference]: With dead ends: 246 [2018-09-26 21:54:01,645 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 21:54:01,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 21:54:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 21:54:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 21:54:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-26 21:54:01,676 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-26 21:54:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:01,676 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-26 21:54:01,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-26 21:54:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 21:54:01,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:01,679 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-26 21:54:01,679 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:01,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-26 21:54:01,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:01,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:01,751 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-26 21:54:01,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:01,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:01,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:01,753 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:01,753 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-26 21:54:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:02,178 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-26 21:54:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:02,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-26 21:54:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:02,180 INFO L225 Difference]: With dead ends: 250 [2018-09-26 21:54:02,180 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 21:54:02,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 21:54:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 21:54:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 21:54:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-26 21:54:02,224 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-26 21:54:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:02,224 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-26 21:54:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-26 21:54:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:54:02,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:02,233 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-26 21:54:02,234 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:02,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-26 21:54:02,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:54:02,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:02,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:54:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:02,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-26 21:54:03,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:54:03,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:54:03,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:54:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:54:03,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:03,030 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-26 21:54:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:06,285 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-26 21:54:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:54:06,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-26 21:54:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:06,288 INFO L225 Difference]: With dead ends: 598 [2018-09-26 21:54:06,289 INFO L226 Difference]: Without dead ends: 406 [2018-09-26 21:54:06,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-26 21:54:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-26 21:54:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 21:54:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-26 21:54:06,326 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-26 21:54:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:06,327 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-26 21:54:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:54:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-26 21:54:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:54:06,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:06,329 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-26 21:54:06,329 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:06,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-26 21:54:06,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:06,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:06,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:06,410 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-26 21:54:06,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:06,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:06,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:06,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:06,411 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-26 21:54:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:06,696 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-26 21:54:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:06,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-26 21:54:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:06,701 INFO L225 Difference]: With dead ends: 399 [2018-09-26 21:54:06,701 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 21:54:06,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 21:54:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 21:54:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 21:54:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-26 21:54:06,731 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-26 21:54:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:06,731 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-26 21:54:06,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-26 21:54:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 21:54:06,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:06,733 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-26 21:54:06,733 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:06,733 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:06,733 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-26 21:54:06,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:06,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:06,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:06,834 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-26 21:54:06,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:06,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:06,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:06,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:06,836 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-26 21:54:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:07,005 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-26 21:54:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:07,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-26 21:54:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:07,008 INFO L225 Difference]: With dead ends: 470 [2018-09-26 21:54:07,008 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 21:54:07,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 21:54:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 21:54:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 21:54:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-26 21:54:07,036 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-26 21:54:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:07,036 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-26 21:54:07,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-26 21:54:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 21:54:07,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:07,038 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-26 21:54:07,038 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:07,038 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-26 21:54:07,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:07,130 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-26 21:54:07,130 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:07,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:07,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:07,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:07,131 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-26 21:54:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:07,422 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-26 21:54:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:07,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-26 21:54:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:07,426 INFO L225 Difference]: With dead ends: 465 [2018-09-26 21:54:07,427 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 21:54:07,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 21:54:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 21:54:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 21:54:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-26 21:54:07,453 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-26 21:54:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-26 21:54:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-26 21:54:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 21:54:07,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:07,455 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-26 21:54:07,455 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:07,455 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-26 21:54:07,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:07,558 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-26 21:54:07,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:07,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:07,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:07,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:07,559 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-26 21:54:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:07,728 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-26 21:54:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:07,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-26 21:54:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:07,730 INFO L225 Difference]: With dead ends: 465 [2018-09-26 21:54:07,730 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 21:54:07,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 21:54:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 21:54:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 21:54:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-26 21:54:07,757 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-26 21:54:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:07,757 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-26 21:54:07,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-26 21:54:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:54:07,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:07,759 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-26 21:54:07,759 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:07,759 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-26 21:54:07,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:07,854 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-26 21:54:07,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:07,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:07,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:07,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:07,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:07,855 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-26 21:54:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:08,112 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-26 21:54:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:08,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-26 21:54:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:08,114 INFO L225 Difference]: With dead ends: 498 [2018-09-26 21:54:08,114 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 21:54:08,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 21:54:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-26 21:54:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 21:54:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-26 21:54:08,143 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-26 21:54:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:08,143 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-26 21:54:08,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-26 21:54:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:54:08,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:08,145 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-26 21:54:08,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:08,145 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-26 21:54:08,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:08,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:08,234 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-26 21:54:08,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:08,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:08,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:08,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:08,235 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-26 21:54:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:08,607 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-26 21:54:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:08,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-26 21:54:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:08,609 INFO L225 Difference]: With dead ends: 561 [2018-09-26 21:54:08,610 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 21:54:08,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 21:54:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 21:54:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 21:54:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-26 21:54:08,657 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-26 21:54:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:08,658 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-26 21:54:08,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-26 21:54:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 21:54:08,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:08,662 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-26 21:54:08,662 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:08,662 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-26 21:54:08,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:08,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-26 21:54:08,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:08,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:08,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:08,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:08,813 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-26 21:54:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:09,164 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-26 21:54:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:09,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-26 21:54:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:09,170 INFO L225 Difference]: With dead ends: 397 [2018-09-26 21:54:09,170 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 21:54:09,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 21:54:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 21:54:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 21:54:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-26 21:54:09,215 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-26 21:54:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:09,215 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-26 21:54:09,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-26 21:54:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:54:09,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:09,217 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-26 21:54:09,218 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:09,218 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-26 21:54:09,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:09,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:09,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:09,236 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-26 21:54:09,236 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-26 21:54:09,236 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-26 21:54:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:09,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:09,635 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-26 21:54:09,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:09,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:09,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:09,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:09,659 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-26 21:54:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:09,856 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-26 21:54:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:09,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-26 21:54:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:09,858 INFO L225 Difference]: With dead ends: 782 [2018-09-26 21:54:09,858 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 21:54:09,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 21:54:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 21:54:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 21:54:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-26 21:54:09,915 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-26 21:54:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:09,916 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-26 21:54:09,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-26 21:54:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 21:54:09,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:09,918 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-26 21:54:09,919 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:09,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-26 21:54:09,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:09,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:10,181 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-26 21:54:10,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:10,182 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-26 21:54:10,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:10,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:10,787 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-26 21:54:10,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:54:10,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:54:10,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:54:10,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:54:10,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:10,821 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-26 21:54:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:11,038 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-26 21:54:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:54:11,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-26 21:54:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:11,039 INFO L225 Difference]: With dead ends: 629 [2018-09-26 21:54:11,039 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:54:11,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:54:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:54:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:54:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:54:11,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-26 21:54:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:11,041 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:54:11,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:54:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:54:11,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:54:11,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:54:11,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:11,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:12,519 WARN L178 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-09-26 21:54:12,685 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-26 21:54:14,003 WARN L178 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-26 21:54:14,323 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:54:14,493 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:54:14,642 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-26 21:54:14,846 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:54:15,034 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:54:15,142 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-26 21:54:15,250 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:54:15,253 INFO L422 ceAbstractionStarter]: At program point L345(lines 345 353) 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-26 21:54:15,253 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-09-26 21:54:15,254 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 320) 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-26 21:54:15,254 INFO L422 ceAbstractionStarter]: At program point L420(lines 420 440) 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-26 21:54:15,254 INFO L422 ceAbstractionStarter]: At program point L482(lines 264 482) 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-26 21:54:15,254 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 427) 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-26 21:54:15,254 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:54:15,254 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:54:15,255 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 417) 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-26 21:54:15,255 INFO L422 ceAbstractionStarter]: At program point L375(lines 375 387) 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-26 21:54:15,255 INFO L422 ceAbstractionStarter]: At program point L462(lines 459 477) 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-26 21:54:15,255 INFO L422 ceAbstractionStarter]: At program point L429(lines 426 448) 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-26 21:54:15,255 INFO L422 ceAbstractionStarter]: At program point L355(lines 355 372) 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-26 21:54:15,256 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L273(lines 236 273) 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-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L269(lines 269 288) 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-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L323(lines 323 340) 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-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L447(lines 447 473) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-09-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-09-26 21:54:15,256 INFO L422 ceAbstractionStarter]: At program point L249(lines 249 265) 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-26 21:54:15,257 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 460) 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-26 21:54:15,257 INFO L422 ceAbstractionStarter]: At program point L390(lines 390 405) 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-26 21:54:15,257 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 301) 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-26 21:54:15,277 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:54:15 BoogieIcfgContainer [2018-09-26 21:54:15,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:54:15,278 INFO L168 Benchmark]: Toolchain (without parser) took 19449.27 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 119.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 449.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:15,280 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:15,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:15,281 INFO L168 Benchmark]: Boogie Preprocessor took 44.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:15,281 INFO L168 Benchmark]: RCFGBuilder took 927.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:15,282 INFO L168 Benchmark]: TraceAbstraction took 18401.55 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 119.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 298.7 MB). Peak memory consumption was 418.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:15,287 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 927.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18401.55 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 119.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 298.7 MB). Peak memory consumption was 418.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: 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: 420]: 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: 345]: 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: 459]: 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: 323]: 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: 355]: 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: 408]: 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: 426]: 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: 236]: 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: 264]: 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: 375]: 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: 439]: 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: 416]: 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: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: 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: 390]: 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: 291]: 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: 304]: 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: 249]: 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s 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.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 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_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-54-15-304.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-54-15-304.csv Received shutdown request...