java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:03:28,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:03:28,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:03:28,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:03:28,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:03:28,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:03:28,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:03:28,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:03:28,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:03:28,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:03:28,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:03:28,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:03:28,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:03:28,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:03:28,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:03:28,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:03:28,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:03:28,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:03:28,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:03:28,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:03:28,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:03:28,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:03:28,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:03:28,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:03:28,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:03:28,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:03:28,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:03:28,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:03:28,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:03:28,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:03:28,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:03:28,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:03:28,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:03:28,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:03:28,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:03:28,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:03:28,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:03:28,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:03:28,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:03:28,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:03:28,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:03:28,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:03:28,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:03:28,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:03:28,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:03:28,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:03:28,633 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:03:28,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:03:28,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:03:28,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:03:28,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:03:28,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:03:28,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:03:28,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:03:28,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:03:28,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:03:28,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:03:28,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:03:28,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:03:28,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:03:28,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:03:28,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:03:28,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:03:28,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:03:28,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:03:28,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:03:28,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:03:28,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:03:28,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:03:28,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:03:28,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:03:28,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:03:28,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:03:28,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:03:28,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:03:28,681 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:03:28,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-09-07 13:03:28,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ce2e36a/a82c39f69eb7434f9afa4f77b239a820/FLAG06c3eea13 [2019-09-07 13:03:29,188 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:03:29,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-09-07 13:03:29,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ce2e36a/a82c39f69eb7434f9afa4f77b239a820/FLAG06c3eea13 [2019-09-07 13:03:29,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ce2e36a/a82c39f69eb7434f9afa4f77b239a820 [2019-09-07 13:03:29,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:03:29,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:03:29,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:03:29,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:03:29,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:03:29,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:03:29" (1/1) ... [2019-09-07 13:03:29,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:29, skipping insertion in model container [2019-09-07 13:03:29,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:03:29" (1/1) ... [2019-09-07 13:03:29,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:03:29,663 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:03:29,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:03:29,952 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:03:30,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:03:30,136 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:03:30,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30 WrapperNode [2019-09-07 13:03:30,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:03:30,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:03:30,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:03:30,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:03:30,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (1/1) ... [2019-09-07 13:03:30,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:03:30,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:03:30,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:03:30,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:03:30,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (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 [2019-09-07 13:03:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:03:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:03:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-07 13:03:30,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:03:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:03:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:03:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:03:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:03:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:03:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-07 13:03:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:03:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:03:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:03:30,584 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:03:31,164 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-07 13:03:31,165 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-07 13:03:31,169 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:03:31,169 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:03:31,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:03:31 BoogieIcfgContainer [2019-09-07 13:03:31,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:03:31,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:03:31,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:03:31,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:03:31,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:03:29" (1/3) ... [2019-09-07 13:03:31,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f0a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:03:31, skipping insertion in model container [2019-09-07 13:03:31,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:03:30" (2/3) ... [2019-09-07 13:03:31,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f0a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:03:31, skipping insertion in model container [2019-09-07 13:03:31,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:03:31" (3/3) ... [2019-09-07 13:03:31,191 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-09-07 13:03:31,203 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:03:31,212 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:03:31,230 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:03:31,258 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:03:31,259 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:03:31,259 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:03:31,259 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:03:31,259 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:03:31,260 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:03:31,260 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:03:31,260 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:03:31,260 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:03:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-07 13:03:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 13:03:31,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:31,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:31,291 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-09-07 13:03:31,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:31,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:03:31,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:31,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:31,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:31,677 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-09-07 13:03:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:32,128 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-09-07 13:03:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:32,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-07 13:03:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:32,144 INFO L225 Difference]: With dead ends: 337 [2019-09-07 13:03:32,144 INFO L226 Difference]: Without dead ends: 180 [2019-09-07 13:03:32,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-07 13:03:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-09-07 13:03:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 13:03:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-09-07 13:03:32,209 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-09-07 13:03:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:32,210 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-09-07 13:03:32,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-09-07 13:03:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 13:03:32,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:32,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:32,214 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-09-07 13:03:32,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:32,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:32,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:03:32,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:32,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:32,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:32,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:32,328 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-09-07 13:03:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:32,615 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-09-07 13:03:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:32,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-07 13:03:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:32,623 INFO L225 Difference]: With dead ends: 385 [2019-09-07 13:03:32,623 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 13:03:32,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 13:03:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-09-07 13:03:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-07 13:03:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-09-07 13:03:32,673 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-09-07 13:03:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:32,674 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-09-07 13:03:32,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-09-07 13:03:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 13:03:32,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:32,683 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:32,683 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-09-07 13:03:32,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:03:32,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:32,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:32,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:32,851 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-09-07 13:03:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:33,137 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-09-07 13:03:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:33,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-07 13:03:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:33,140 INFO L225 Difference]: With dead ends: 450 [2019-09-07 13:03:33,140 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 13:03:33,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 13:03:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-07 13:03:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-07 13:03:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-09-07 13:03:33,159 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-09-07 13:03:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:33,160 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-09-07 13:03:33,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-09-07 13:03:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 13:03:33,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:33,163 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:33,163 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-09-07 13:03:33,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:33,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:33,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:33,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:33,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:33,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:33,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:33,254 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-09-07 13:03:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:33,457 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-09-07 13:03:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:33,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 13:03:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:33,460 INFO L225 Difference]: With dead ends: 498 [2019-09-07 13:03:33,460 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 13:03:33,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 13:03:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-07 13:03:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-07 13:03:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-09-07 13:03:33,496 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-09-07 13:03:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:33,496 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-09-07 13:03:33,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-09-07 13:03:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 13:03:33,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:33,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:33,506 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-09-07 13:03:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:33,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:03:33,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:33,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:33,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:33,616 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-09-07 13:03:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:33,871 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-09-07 13:03:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:33,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 13:03:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:33,876 INFO L225 Difference]: With dead ends: 557 [2019-09-07 13:03:33,877 INFO L226 Difference]: Without dead ends: 308 [2019-09-07 13:03:33,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-07 13:03:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-09-07 13:03:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-07 13:03:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-09-07 13:03:33,897 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-09-07 13:03:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:33,898 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-09-07 13:03:33,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-09-07 13:03:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 13:03:33,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:33,900 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:33,901 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-09-07 13:03:33,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:33,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:33,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:33,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:33,966 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-09-07 13:03:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:34,143 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-09-07 13:03:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:34,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-07 13:03:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:34,146 INFO L225 Difference]: With dead ends: 597 [2019-09-07 13:03:34,146 INFO L226 Difference]: Without dead ends: 306 [2019-09-07 13:03:34,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-07 13:03:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-07 13:03:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-07 13:03:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-09-07 13:03:34,163 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-09-07 13:03:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:34,164 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-09-07 13:03:34,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-09-07 13:03:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 13:03:34,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:34,166 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:34,166 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-09-07 13:03:34,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:34,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:34,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:03:34,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:34,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:34,262 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-09-07 13:03:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:34,481 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-09-07 13:03:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:34,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-07 13:03:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:34,484 INFO L225 Difference]: With dead ends: 599 [2019-09-07 13:03:34,484 INFO L226 Difference]: Without dead ends: 306 [2019-09-07 13:03:34,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-07 13:03:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-09-07 13:03:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-07 13:03:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-09-07 13:03:34,498 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-09-07 13:03:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:34,499 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-09-07 13:03:34,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-09-07 13:03:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 13:03:34,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:34,501 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:34,501 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-09-07 13:03:34,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:34,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 13:03:34,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:34,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:34,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:34,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:34,581 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-09-07 13:03:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:34,749 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-09-07 13:03:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:34,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-07 13:03:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:34,752 INFO L225 Difference]: With dead ends: 600 [2019-09-07 13:03:34,752 INFO L226 Difference]: Without dead ends: 311 [2019-09-07 13:03:34,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-07 13:03:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-09-07 13:03:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-07 13:03:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-09-07 13:03:34,767 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-09-07 13:03:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:34,767 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-09-07 13:03:34,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-09-07 13:03:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 13:03:34,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:34,769 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:34,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-09-07 13:03:34,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:34,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:34,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:34,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:34,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:34,842 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-09-07 13:03:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:35,042 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-09-07 13:03:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:35,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 13:03:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:35,045 INFO L225 Difference]: With dead ends: 640 [2019-09-07 13:03:35,046 INFO L226 Difference]: Without dead ends: 342 [2019-09-07 13:03:35,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-07 13:03:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-07 13:03:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 13:03:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-09-07 13:03:35,062 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-09-07 13:03:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:35,064 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-09-07 13:03:35,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-09-07 13:03:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 13:03:35,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:35,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:35,066 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-09-07 13:03:35,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:35,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:35,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:35,144 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-09-07 13:03:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:35,370 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-09-07 13:03:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:35,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-07 13:03:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:35,373 INFO L225 Difference]: With dead ends: 669 [2019-09-07 13:03:35,373 INFO L226 Difference]: Without dead ends: 342 [2019-09-07 13:03:35,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-07 13:03:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-07 13:03:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 13:03:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-09-07 13:03:35,416 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-09-07 13:03:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:35,416 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-09-07 13:03:35,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-09-07 13:03:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 13:03:35,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:35,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:35,421 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-09-07 13:03:35,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:35,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:35,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:35,511 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-09-07 13:03:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:35,718 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-09-07 13:03:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:35,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-07 13:03:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:35,721 INFO L225 Difference]: With dead ends: 702 [2019-09-07 13:03:35,722 INFO L226 Difference]: Without dead ends: 375 [2019-09-07 13:03:35,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-07 13:03:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-07 13:03:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-07 13:03:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-09-07 13:03:35,739 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-09-07 13:03:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:35,739 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-09-07 13:03:35,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-09-07 13:03:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 13:03:35,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:35,741 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:35,741 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-09-07 13:03:35,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:35,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:35,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:35,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:03:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:35,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:35,796 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-09-07 13:03:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:36,012 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-09-07 13:03:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:36,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-07 13:03:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:36,016 INFO L225 Difference]: With dead ends: 729 [2019-09-07 13:03:36,016 INFO L226 Difference]: Without dead ends: 375 [2019-09-07 13:03:36,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-07 13:03:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-07 13:03:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-07 13:03:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-09-07 13:03:36,041 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-09-07 13:03:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:36,042 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-09-07 13:03:36,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-09-07 13:03:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 13:03:36,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:36,044 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:36,044 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-09-07 13:03:36,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:03:36,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:36,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:36,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:36,109 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-09-07 13:03:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:36,364 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-09-07 13:03:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:36,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-07 13:03:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:36,367 INFO L225 Difference]: With dead ends: 746 [2019-09-07 13:03:36,367 INFO L226 Difference]: Without dead ends: 392 [2019-09-07 13:03:36,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-07 13:03:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-07 13:03:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-07 13:03:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-09-07 13:03:36,389 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-09-07 13:03:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:36,389 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-09-07 13:03:36,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-09-07 13:03:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 13:03:36,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:36,391 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:36,391 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-09-07 13:03:36,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:36,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:03:36,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:36,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:36,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:36,442 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-09-07 13:03:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:36,627 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-09-07 13:03:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:36,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-07 13:03:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:36,629 INFO L225 Difference]: With dead ends: 767 [2019-09-07 13:03:36,630 INFO L226 Difference]: Without dead ends: 392 [2019-09-07 13:03:36,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-07 13:03:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-07 13:03:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-07 13:03:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-09-07 13:03:36,649 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-09-07 13:03:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:36,649 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-09-07 13:03:36,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-09-07 13:03:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 13:03:36,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:36,651 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:36,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-09-07 13:03:36,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 13:03:36,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:36,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:36,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:36,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:36,717 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-09-07 13:03:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:36,790 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-09-07 13:03:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:36,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-07 13:03:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:36,796 INFO L225 Difference]: With dead ends: 763 [2019-09-07 13:03:36,796 INFO L226 Difference]: Without dead ends: 761 [2019-09-07 13:03:36,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-09-07 13:03:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-09-07 13:03:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-07 13:03:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-09-07 13:03:36,846 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-09-07 13:03:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:36,847 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-09-07 13:03:36,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-09-07 13:03:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 13:03:36,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:36,852 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:36,852 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-09-07 13:03:36,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:36,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:36,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:36,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:03:36,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:36,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:36,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:36,930 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-09-07 13:03:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:37,310 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-09-07 13:03:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:37,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-07 13:03:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:37,316 INFO L225 Difference]: With dead ends: 1593 [2019-09-07 13:03:37,316 INFO L226 Difference]: Without dead ends: 845 [2019-09-07 13:03:37,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-07 13:03:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-09-07 13:03:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-07 13:03:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-09-07 13:03:37,362 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-09-07 13:03:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:37,362 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-09-07 13:03:37,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-09-07 13:03:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 13:03:37,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:37,366 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:37,366 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-09-07 13:03:37,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:37,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:37,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:37,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:03:37,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:37,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:37,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:37,428 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-09-07 13:03:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:37,653 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-09-07 13:03:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:37,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-07 13:03:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:37,658 INFO L225 Difference]: With dead ends: 1669 [2019-09-07 13:03:37,658 INFO L226 Difference]: Without dead ends: 841 [2019-09-07 13:03:37,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-07 13:03:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-09-07 13:03:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-07 13:03:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-09-07 13:03:37,702 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-09-07 13:03:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:37,703 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-09-07 13:03:37,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-09-07 13:03:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 13:03:37,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:37,706 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:37,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-09-07 13:03:37,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:37,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 13:03:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:37,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:37,772 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-09-07 13:03:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:38,024 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-09-07 13:03:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:38,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-09-07 13:03:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:38,030 INFO L225 Difference]: With dead ends: 1729 [2019-09-07 13:03:38,030 INFO L226 Difference]: Without dead ends: 909 [2019-09-07 13:03:38,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-07 13:03:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-09-07 13:03:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-07 13:03:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-09-07 13:03:38,081 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-09-07 13:03:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:38,081 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-09-07 13:03:38,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-09-07 13:03:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 13:03:38,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:38,087 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:38,087 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-09-07 13:03:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 13:03:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:38,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:38,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:38,155 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-09-07 13:03:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:38,387 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-09-07 13:03:38,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:38,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-07 13:03:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:38,392 INFO L225 Difference]: With dead ends: 1801 [2019-09-07 13:03:38,393 INFO L226 Difference]: Without dead ends: 905 [2019-09-07 13:03:38,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-07 13:03:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-09-07 13:03:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-07 13:03:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-09-07 13:03:38,443 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-09-07 13:03:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:38,444 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-09-07 13:03:38,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-09-07 13:03:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-07 13:03:38,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:38,448 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:38,448 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-09-07 13:03:38,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-07 13:03:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:38,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:38,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:38,526 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-09-07 13:03:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:38,784 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-09-07 13:03:38,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:38,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-09-07 13:03:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:38,790 INFO L225 Difference]: With dead ends: 1861 [2019-09-07 13:03:38,790 INFO L226 Difference]: Without dead ends: 973 [2019-09-07 13:03:38,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-07 13:03:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-09-07 13:03:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-09-07 13:03:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-09-07 13:03:38,833 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-09-07 13:03:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:38,833 INFO L475 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-09-07 13:03:38,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-09-07 13:03:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 13:03:38,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:38,837 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:38,838 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-09-07 13:03:38,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:38,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-07 13:03:38,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:38,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:38,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:38,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:38,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:38,905 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-09-07 13:03:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:39,146 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-09-07 13:03:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:39,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-09-07 13:03:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:39,151 INFO L225 Difference]: With dead ends: 1929 [2019-09-07 13:03:39,152 INFO L226 Difference]: Without dead ends: 969 [2019-09-07 13:03:39,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-07 13:03:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-09-07 13:03:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-07 13:03:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-09-07 13:03:39,195 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-09-07 13:03:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:39,195 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-09-07 13:03:39,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-09-07 13:03:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 13:03:39,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:39,199 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:39,200 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-09-07 13:03:39,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-07 13:03:39,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:39,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:39,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:39,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:39,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:39,290 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-09-07 13:03:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:39,529 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-09-07 13:03:39,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:39,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-07 13:03:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:39,535 INFO L225 Difference]: With dead ends: 1993 [2019-09-07 13:03:39,536 INFO L226 Difference]: Without dead ends: 1041 [2019-09-07 13:03:39,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-09-07 13:03:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-09-07 13:03:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-07 13:03:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-09-07 13:03:39,585 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-09-07 13:03:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:39,585 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-09-07 13:03:39,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-09-07 13:03:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 13:03:39,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:39,590 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:39,590 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-09-07 13:03:39,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:39,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:39,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-07 13:03:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:39,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:39,669 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-09-07 13:03:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:39,861 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-09-07 13:03:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:39,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-07 13:03:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:39,867 INFO L225 Difference]: With dead ends: 2043 [2019-09-07 13:03:39,867 INFO L226 Difference]: Without dead ends: 1041 [2019-09-07 13:03:39,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-09-07 13:03:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-09-07 13:03:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-07 13:03:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-09-07 13:03:39,911 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-09-07 13:03:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:39,911 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-09-07 13:03:39,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-09-07 13:03:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 13:03:39,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:39,916 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:39,916 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-09-07 13:03:39,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 13:03:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:39,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:39,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:39,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:39,999 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-09-07 13:03:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:40,257 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-09-07 13:03:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:40,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-09-07 13:03:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:40,263 INFO L225 Difference]: With dead ends: 2025 [2019-09-07 13:03:40,263 INFO L226 Difference]: Without dead ends: 1023 [2019-09-07 13:03:40,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-09-07 13:03:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-09-07 13:03:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-07 13:03:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-09-07 13:03:40,322 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-09-07 13:03:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:40,323 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-09-07 13:03:40,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-09-07 13:03:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 13:03:40,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:40,328 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:40,328 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-09-07 13:03:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:40,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 13:03:40,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:40,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:40,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:40,410 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-09-07 13:03:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:40,625 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-09-07 13:03:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:40,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-09-07 13:03:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:40,630 INFO L225 Difference]: With dead ends: 2025 [2019-09-07 13:03:40,630 INFO L226 Difference]: Without dead ends: 1005 [2019-09-07 13:03:40,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-07 13:03:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-09-07 13:03:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-07 13:03:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-09-07 13:03:40,677 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-09-07 13:03:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:40,677 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-09-07 13:03:40,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-09-07 13:03:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 13:03:40,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:40,682 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:40,682 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-09-07 13:03:40,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:40,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-07 13:03:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:40,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:40,789 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-09-07 13:03:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:41,086 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-09-07 13:03:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:41,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-07 13:03:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:41,094 INFO L225 Difference]: With dead ends: 2035 [2019-09-07 13:03:41,094 INFO L226 Difference]: Without dead ends: 1051 [2019-09-07 13:03:41,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-07 13:03:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-09-07 13:03:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-07 13:03:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-09-07 13:03:41,165 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-09-07 13:03:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:41,166 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-09-07 13:03:41,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-09-07 13:03:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-07 13:03:41,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:41,174 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:41,174 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-09-07 13:03:41,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:41,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:41,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:41,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-07 13:03:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:03:41,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:41,297 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-09-07 13:03:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:41,580 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-09-07 13:03:41,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:03:41,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-07 13:03:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:41,585 INFO L225 Difference]: With dead ends: 2081 [2019-09-07 13:03:41,586 INFO L226 Difference]: Without dead ends: 1043 [2019-09-07 13:03:41,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:03:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-09-07 13:03:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-09-07 13:03:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-09-07 13:03:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-09-07 13:03:41,640 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-09-07 13:03:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:41,640 INFO L475 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-09-07 13:03:41,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-09-07 13:03:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-07 13:03:41,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:41,645 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:41,645 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-09-07 13:03:41,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:41,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:41,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-07 13:03:41,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:03:41,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:03:41,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:41,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 13:03:41,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:03:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-07 13:03:42,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:03:42,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:03:42,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:03:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:03:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:42,050 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 5 states. [2019-09-07 13:03:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:42,748 INFO L93 Difference]: Finished difference Result 4109 states and 5944 transitions. [2019-09-07 13:03:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:03:42,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2019-09-07 13:03:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:42,764 INFO L225 Difference]: With dead ends: 4109 [2019-09-07 13:03:42,765 INFO L226 Difference]: Without dead ends: 3054 [2019-09-07 13:03:42,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:03:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2019-09-07 13:03:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 1752. [2019-09-07 13:03:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-09-07 13:03:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2511 transitions. [2019-09-07 13:03:42,911 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2511 transitions. Word has length 267 [2019-09-07 13:03:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:42,912 INFO L475 AbstractCegarLoop]: Abstraction has 1752 states and 2511 transitions. [2019-09-07 13:03:42,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:03:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2511 transitions. [2019-09-07 13:03:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-07 13:03:42,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:42,920 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:42,921 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-09-07 13:03:42,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:42,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 13:03:43,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:43,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:43,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:43,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:43,095 INFO L87 Difference]: Start difference. First operand 1752 states and 2511 transitions. Second operand 3 states. [2019-09-07 13:03:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:43,270 INFO L93 Difference]: Finished difference Result 4825 states and 6872 transitions. [2019-09-07 13:03:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:43,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-07 13:03:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:43,291 INFO L225 Difference]: With dead ends: 4825 [2019-09-07 13:03:43,292 INFO L226 Difference]: Without dead ends: 3092 [2019-09-07 13:03:43,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-09-07 13:03:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3090. [2019-09-07 13:03:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-09-07 13:03:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4377 transitions. [2019-09-07 13:03:43,564 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4377 transitions. Word has length 274 [2019-09-07 13:03:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:43,565 INFO L475 AbstractCegarLoop]: Abstraction has 3090 states and 4377 transitions. [2019-09-07 13:03:43,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4377 transitions. [2019-09-07 13:03:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-07 13:03:43,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:43,579 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:43,580 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-09-07 13:03:43,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:43,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:43,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:43,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 13:03:43,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:43,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:43,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:43,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:43,802 INFO L87 Difference]: Start difference. First operand 3090 states and 4377 transitions. Second operand 3 states. [2019-09-07 13:03:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:44,089 INFO L93 Difference]: Finished difference Result 6281 states and 8908 transitions. [2019-09-07 13:03:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:44,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-07 13:03:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:44,115 INFO L225 Difference]: With dead ends: 6281 [2019-09-07 13:03:44,115 INFO L226 Difference]: Without dead ends: 1961 [2019-09-07 13:03:44,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-09-07 13:03:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1954. [2019-09-07 13:03:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-07 13:03:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-09-07 13:03:44,233 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 311 [2019-09-07 13:03:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:44,234 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-09-07 13:03:44,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-09-07 13:03:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-07 13:03:44,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:44,260 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:44,261 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-09-07 13:03:44,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:44,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:44,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-07 13:03:44,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:03:44,574 INFO L223 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) [2019-09-07 13:03:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:03:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:44,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:03:44,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:03:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-07 13:03:44,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:03:44,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 13:03:44,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:03:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:03:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:03:44,984 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-09-07 13:03:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:45,315 INFO L93 Difference]: Finished difference Result 4809 states and 6669 transitions. [2019-09-07 13:03:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:03:45,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-09-07 13:03:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:45,322 INFO L225 Difference]: With dead ends: 4809 [2019-09-07 13:03:45,322 INFO L226 Difference]: Without dead ends: 2736 [2019-09-07 13:03:45,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:03:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-09-07 13:03:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-09-07 13:03:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-07 13:03:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-09-07 13:03:45,444 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-09-07 13:03:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:45,445 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-09-07 13:03:45,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:03:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-09-07 13:03:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-07 13:03:45,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:45,464 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:45,464 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-09-07 13:03:45,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-09-07 13:03:45,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:45,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:45,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:45,816 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-09-07 13:03:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:46,038 INFO L93 Difference]: Finished difference Result 3929 states and 5418 transitions. [2019-09-07 13:03:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:46,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-09-07 13:03:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:46,043 INFO L225 Difference]: With dead ends: 3929 [2019-09-07 13:03:46,044 INFO L226 Difference]: Without dead ends: 1994 [2019-09-07 13:03:46,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-09-07 13:03:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-09-07 13:03:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-07 13:03:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-09-07 13:03:46,141 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-09-07 13:03:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:46,141 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-09-07 13:03:46,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-09-07 13:03:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-07 13:03:46,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:46,156 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:46,156 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:46,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-09-07 13:03:46,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-09-07 13:03:46,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:46,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:46,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:46,565 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-09-07 13:03:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:46,774 INFO L93 Difference]: Finished difference Result 3921 states and 5369 transitions. [2019-09-07 13:03:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:46,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-09-07 13:03:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:46,779 INFO L225 Difference]: With dead ends: 3921 [2019-09-07 13:03:46,780 INFO L226 Difference]: Without dead ends: 1986 [2019-09-07 13:03:46,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-09-07 13:03:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-09-07 13:03:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-09-07 13:03:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-09-07 13:03:46,888 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-09-07 13:03:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:46,889 INFO L475 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-09-07 13:03:46,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-09-07 13:03:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-07 13:03:46,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:46,914 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:46,914 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-09-07 13:03:46,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:46,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:46,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:46,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-09-07 13:03:47,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:47,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:47,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:47,324 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-09-07 13:03:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:47,553 INFO L93 Difference]: Finished difference Result 3943 states and 5323 transitions. [2019-09-07 13:03:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:47,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-09-07 13:03:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:47,558 INFO L225 Difference]: With dead ends: 3943 [2019-09-07 13:03:47,558 INFO L226 Difference]: Without dead ends: 2003 [2019-09-07 13:03:47,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-09-07 13:03:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-09-07 13:03:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-09-07 13:03:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-09-07 13:03:47,677 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-09-07 13:03:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:47,677 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-09-07 13:03:47,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-09-07 13:03:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-09-07 13:03:47,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:03:47,699 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:03:47,699 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:03:47,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:03:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-09-07 13:03:47,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:03:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:03:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:47,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:03:47,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:03:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:03:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-09-07 13:03:48,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:03:48,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:03:48,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:03:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:03:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:48,008 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-09-07 13:03:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:03:48,143 INFO L93 Difference]: Finished difference Result 2548 states and 3406 transitions. [2019-09-07 13:03:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:03:48,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-09-07 13:03:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:03:48,144 INFO L225 Difference]: With dead ends: 2548 [2019-09-07 13:03:48,144 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:03:48,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:03:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:03:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:03:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:03:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:03:48,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-09-07 13:03:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:03:48,150 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:03:48,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:03:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:03:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:03:48,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:03:49,719 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 200 [2019-09-07 13:03:50,282 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 159 [2019-09-07 13:03:50,787 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 199 [2019-09-07 13:03:52,517 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2019-09-07 13:03:53,461 WARN L188 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 116 [2019-09-07 13:03:54,259 WARN L188 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2019-09-07 13:03:55,126 WARN L188 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-09-07 13:03:55,508 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 85 [2019-09-07 13:03:56,247 WARN L188 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 93 [2019-09-07 13:03:57,471 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 153 DAG size of output: 116 [2019-09-07 13:03:58,737 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2019-09-07 13:03:59,902 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 160 DAG size of output: 101 [2019-09-07 13:04:01,677 WARN L188 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 191 DAG size of output: 111 [2019-09-07 13:04:02,533 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 116 [2019-09-07 13:04:02,681 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-07 13:04:03,427 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 93 [2019-09-07 13:04:04,642 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 160 DAG size of output: 99 [2019-09-07 13:04:05,490 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 92 [2019-09-07 13:04:06,437 WARN L188 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 116 [2019-09-07 13:04:06,585 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-07 13:04:07,685 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2019-09-07 13:04:08,148 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-09-07 13:04:09,277 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 156 DAG size of output: 123 [2019-09-07 13:04:11,275 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 159 DAG size of output: 118 [2019-09-07 13:04:12,647 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 189 DAG size of output: 107 [2019-09-07 13:04:13,368 WARN L188 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 114 [2019-09-07 13:04:14,183 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 93 [2019-09-07 13:04:14,186 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:04:14,186 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:04:14,186 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:04:14,186 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:04:14,186 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:04:14,186 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:04:14,186 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 611 622) the Hoare annotation is: true [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 611 622) no Hoare annotation was computed. [2019-09-07 13:04:14,187 INFO L439 ceAbstractionStarter]: At program point L618(line 618) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 611 622) no Hoare annotation was computed. [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-09-07 13:04:14,187 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 545) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 556) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 567) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 578) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L446 ceAbstractionStarter]: At program point L598(lines 98 599) the Hoare annotation is: true [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-09-07 13:04:14,188 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-09-07 13:04:14,189 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 546) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 3))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (and (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) .cse0 (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8577)) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__hit~0 0)) (not (= ssl3_accept_~s__state~0 8592))) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 (<= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,189 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 578) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8577)) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__hit~0 0)) (not (= ssl3_accept_~s__state~0 8592))) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)) [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 544) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 555) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 566) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 577) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-09-07 13:04:14,190 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 544) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (not (= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)) [2019-09-07 13:04:14,191 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 556) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8641))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8608))) (.cse8 (not (= ssl3_accept_~s__state~0 8656))) (.cse9 (not (= ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ssl3_accept_~s__state~0 8528))) (.cse11 (not (= ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ssl3_accept_~s__state~0 8480))) (.cse14 (not (= ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ssl3_accept_~s__state~0 8512))) (.cse17 (not (= ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ssl3_accept_~s__state~0 8560))) (.cse19 (not (= ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ssl3_accept_~s__state~0 8672) .cse21) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ssl3_accept_~blastFlag~0 3) .cse14 (not (= ssl3_accept_~s__state~0 12292)) .cse15 .cse16 .cse17 (not (= ssl3_accept_~s__state~0 8673)) .cse18 .cse19 .cse20 (not (= ssl3_accept_~s__hit~0 0)) .cse21) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,191 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 567) the Hoare annotation is: (let ((.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse8 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse9 (= |ssl3_accept_#in~initial_state| 8544)) (.cse10 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse12 (= |ssl3_accept_#in~initial_state| 8561)) (.cse11 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse1 (and (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse8) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse9) (not .cse10) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not .cse12) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not .cse11))) (.cse2 (not (= ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ssl3_accept_~s__state~0 8576))) (.cse6 (not (= ssl3_accept_~s__state~0 8513))) (.cse7 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 (= |ssl3_accept_#in~initial_state| 8593) (and (<= 8448 ssl3_accept_~s__state~0) (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) .cse8 (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) .cse9 .cse10 .cse11 (= 8640 |ssl3_accept_#in~initial_state|) .cse12 (and (and .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 3) .cse3 .cse4 .cse5 .cse6 .cse7) (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-09-07 13:04:14,191 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 544) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (not (= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)) [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 554) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 565) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 576) no Hoare annotation was computed. [2019-09-07 13:04:14,192 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 610) the Hoare annotation is: true [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 553) no Hoare annotation was computed. [2019-09-07 13:04:14,193 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 564) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 575) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L443 ceAbstractionStarter]: For program point L475-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-09-07 13:04:14,194 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 577) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8641))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8608))) (.cse8 (not (= ssl3_accept_~s__state~0 8656))) (.cse9 (not (= ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ssl3_accept_~s__state~0 8528))) (.cse11 (not (= ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ssl3_accept_~s__state~0 8480))) (.cse14 (not (= ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ssl3_accept_~s__state~0 8577))) (.cse16 (not (= ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ssl3_accept_~s__state~0 8512))) (.cse18 (not (= ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ssl3_accept_~s__state~0 8673))) (.cse20 (not (= ssl3_accept_~s__state~0 8576))) (.cse21 (not (= ssl3_accept_~s__state~0 8560))) (.cse22 (not (= ssl3_accept_~s__state~0 8513))) (.cse23 (not (= ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ssl3_accept_~blastFlag~0 3) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (not (= ssl3_accept_~s__hit~0 0)) .cse24) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ssl3_accept_~s__state~0 12292)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,195 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 554) the Hoare annotation is: (let ((.cse9 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse10 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593))) (let ((.cse2 (not (= ssl3_accept_~s__state~0 8577))) (.cse3 (not (= ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (and (not .cse9) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8496)) (not .cse10) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not .cse1) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__state~0 8656)))) (.cse6 (not (= ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ssl3_accept_~s__state~0 8529)))) (or .cse0 .cse1 (and (and .cse2 (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 8448 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8529) .cse9 .cse10 (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ssl3_accept_~s__hit~0 0))) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-09-07 13:04:14,195 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 565) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ssl3_accept_~s__state~0 8560))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (<= 8448 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,196 INFO L439 ceAbstractionStarter]: At program point L542(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8448 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ssl3_accept_~blastFlag~0 3))) (or (= 8513 |ssl3_accept_#in~initial_state|) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse1) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (and (not (= ssl3_accept_~s__state~0 8481)) .cse2 (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) .cse3 (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 8577)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) .cse1) (= 8560 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (and (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0) .cse3 (<= ssl3_accept_~s__state~0 8448)) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (<= ssl3_accept_~s__state~0 3) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8512) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577))) [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 552) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 563) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 574) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-09-07 13:04:14,196 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L439 ceAbstractionStarter]: At program point L513(lines 72 609) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)) [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 551) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 562) no Hoare annotation was computed. [2019-09-07 13:04:14,197 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-09-07 13:04:14,198 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 573) no Hoare annotation was computed. [2019-09-07 13:04:14,198 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-09-07 13:04:14,198 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-09-07 13:04:14,198 INFO L443 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-09-07 13:04:14,198 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 552) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8641))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ssl3_accept_~s__state~0 8528))) (.cse10 (not (= ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ssl3_accept_~s__state~0 8480))) (.cse13 (not (= ssl3_accept_~s__state~0 8657))) (.cse14 (not (= ssl3_accept_~s__state~0 8577))) (.cse15 (not (= ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ssl3_accept_~s__state~0 8512))) (.cse17 (not (= ssl3_accept_~s__state~0 8576))) (.cse18 (not (= ssl3_accept_~s__state~0 8560))) (.cse19 (not (= ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ssl3_accept_~blastFlag~0 3) .cse13 (not (= ssl3_accept_~s__state~0 12292)) .cse14 .cse15 .cse16 (not (= ssl3_accept_~s__state~0 8673)) .cse17 .cse18 .cse19 .cse20 (not (= ssl3_accept_~s__hit~0 0)) .cse21) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ssl3_accept_~s__state~0 8672) .cse21) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,199 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 563) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8496))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (<= 8448 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-09-07 13:04:14,199 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-09-07 13:04:14,200 INFO L439 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8496))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (<= 8448 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,200 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 550) no Hoare annotation was computed. [2019-09-07 13:04:14,200 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 561) no Hoare annotation was computed. [2019-09-07 13:04:14,200 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 572) no Hoare annotation was computed. [2019-09-07 13:04:14,200 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-09-07 13:04:14,200 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-09-07 13:04:14,201 INFO L439 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (<= 8448 ssl3_accept_~s__state~0) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,201 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 573) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8529))) (.cse1 (not (= ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= 8448 ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |ssl3_accept_#in~initial_state| 8529) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,201 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-09-07 13:04:14,201 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-09-07 13:04:14,201 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-09-07 13:04:14,201 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 610) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L321-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 549) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 560) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 571) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-09-07 13:04:14,202 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 609) no Hoare annotation was computed. [2019-09-07 13:04:14,203 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-09-07 13:04:14,203 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 550) the Hoare annotation is: (let ((.cse8 (not (= ssl3_accept_~s__state~0 8481))) (.cse20 (not (= ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ssl3_accept_~s__state~0 8672))) (.cse14 (not (= ssl3_accept_~s__state~0 8561))) (.cse15 (not (= ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ssl3_accept_~s__state~0 8593))) (.cse3 (not (= ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ssl3_accept_~s__state~0 8480))) (.cse12 (not (= ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ssl3_accept_~s__state~0 8609))) (.cse5 (not (= ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ssl3_accept_~s__state~0 8513))) (.cse18 (not (= ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__state~0 12292)) .cse13 .cse14 .cse15 (not (= ssl3_accept_~s__state~0 8673)) .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) (not (= ssl3_accept_~s__hit~0 0))) (and .cse8 (<= ssl3_accept_~blastFlag~0 2) .cse20 .cse13 .cse14 .cse15 (<= 8448 ssl3_accept_~s__state~0) .cse16 .cse6 .cse19 .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse0 .cse2 .cse4 .cse5 .cse17 .cse7 .cse18 (<= ssl3_accept_~s__state~0 8672) .cse21) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,203 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 561) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (<= 8448 ssl3_accept_~s__state~0) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,204 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 571) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (<= ssl3_accept_~s__state~0 8576)) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)) [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 610) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 548) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 559) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 570) no Hoare annotation was computed. [2019-09-07 13:04:14,204 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-09-07 13:04:14,205 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 547) no Hoare annotation was computed. [2019-09-07 13:04:14,206 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 558) no Hoare annotation was computed. [2019-09-07 13:04:14,206 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 569) no Hoare annotation was computed. [2019-09-07 13:04:14,206 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 548) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8641))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8608))) (.cse8 (not (= ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ssl3_accept_~s__state~0 8528))) (.cse10 (not (= ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ssl3_accept_~s__state~0 8480))) (.cse13 (not (= ssl3_accept_~s__state~0 8577))) (.cse14 (not (= ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ssl3_accept_~s__state~0 8512))) (.cse16 (not (= ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ssl3_accept_~s__state~0 8576))) (.cse18 (not (= ssl3_accept_~s__state~0 8560))) (.cse19 (not (= ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ssl3_accept_~s__state~0 8592)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__state~0 12292)) .cse13 .cse14 .cse15 .cse16 (not (= ssl3_accept_~s__state~0 8673)) .cse17 .cse18 .cse19 .cse20 (not (= ssl3_accept_~s__hit~0 0)) .cse21) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ssl3_accept_~s__state~0 8672) .cse21) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,206 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 559) the Hoare annotation is: (let ((.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse14 (= |ssl3_accept_#in~initial_state| 8561)) (.cse2 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse3 (not (= ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ssl3_accept_~s__state~0 8496))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ssl3_accept_~s__state~0 8576))) (.cse10 (and (not .cse0) (not .cse1) (not (= ssl3_accept_~s__state~0 8448)) (not .cse14) (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse2))) (.cse11 (not (= ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ssl3_accept_~s__state~0 8497))) (.cse13 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) .cse1 .cse2 (= 8640 |ssl3_accept_#in~initial_state|) (and (<= 8448 ssl3_accept_~s__state~0) (and (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse14 (= |ssl3_accept_#in~initial_state| 8512) (and (not (= ssl3_accept_~s__hit~0 0)) (and .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 546) no Hoare annotation was computed. [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 557) no Hoare annotation was computed. [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 568) no Hoare annotation was computed. [2019-09-07 13:04:14,207 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 597) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ssl3_accept_~blastFlag~0 2))) (or (= 8513 |ssl3_accept_#in~initial_state|) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 (<= ssl3_accept_~s__state~0 8672)) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (= 8560 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (and (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0) (<= 8448 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8448)) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (<= ssl3_accept_~s__state~0 3) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8512) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (and (not (= ssl3_accept_~s__state~0 8481)) .cse1 (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8577)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497))) (= 8448 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577))) [2019-09-07 13:04:14,207 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-09-07 13:04:14,208 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-09-07 13:04:14,208 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-09-07 13:04:14,208 INFO L443 ceAbstractionStarter]: For program point L496-2(lines 208 541) no Hoare annotation was computed. [2019-09-07 13:04:14,208 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8513))) (.cse11 (not (= ssl3_accept_~s__state~0 8497))) (.cse12 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~blastFlag~0 3) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ssl3_accept_~s__hit~0 0))) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (<= 8448 ssl3_accept_~s__state~0) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,208 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-09-07 13:04:14,209 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 557) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8480))) (.cse8 (not (= ssl3_accept_~s__state~0 8512))) (.cse9 (not (= ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ssl3_accept_~s__state~0 8560))) (.cse11 (not (= ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ssl3_accept_~s__state~0 8497))) (.cse13 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ssl3_accept_~blastFlag~0 3) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= 8448 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8448)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:04:14,209 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 570) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ssl3_accept_~s__state~0 8512))) (.cse10 (not (= ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ssl3_accept_~s__state~0 8560))) (.cse12 (not (= ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ssl3_accept_~s__state~0 8497))) (.cse14 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (<= 8448 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ssl3_accept_~s__hit~0 0))))) [2019-09-07 13:04:14,209 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 13:04:14,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:04:14 BoogieIcfgContainer [2019-09-07 13:04:14,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:04:14,258 INFO L168 Benchmark]: Toolchain (without parser) took 44677.26 ms. Allocated memory was 137.4 MB in the beginning and 965.2 MB in the end (delta: 827.9 MB). Free memory was 93.2 MB in the beginning and 640.7 MB in the end (delta: -547.5 MB). Peak memory consumption was 821.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,258 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 554.89 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 93.0 MB in the beginning and 174.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,260 INFO L168 Benchmark]: Boogie Preprocessor took 79.32 ms. Allocated memory is still 200.8 MB. Free memory was 174.2 MB in the beginning and 171.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,260 INFO L168 Benchmark]: RCFGBuilder took 954.36 ms. Allocated memory is still 200.8 MB. Free memory was 171.7 MB in the beginning and 122.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,261 INFO L168 Benchmark]: TraceAbstraction took 43084.09 ms. Allocated memory was 200.8 MB in the beginning and 965.2 MB in the end (delta: 764.4 MB). Free memory was 122.5 MB in the beginning and 640.7 MB in the end (delta: -518.2 MB). Peak memory consumption was 787.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:04:14,264 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 554.89 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 93.0 MB in the beginning and 174.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.32 ms. Allocated memory is still 200.8 MB. Free memory was 174.2 MB in the beginning and 171.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 954.36 ms. Allocated memory is still 200.8 MB. Free memory was 171.7 MB in the beginning and 122.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43084.09 ms. Allocated memory was 200.8 MB in the beginning and 965.2 MB in the end (delta: 764.4 MB). Free memory was 122.5 MB in the beginning and 640.7 MB in the end (delta: -518.2 MB). Peak memory consumption was 787.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || ((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592))) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8672) && !(s__state == 8592))) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || ((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496) || ((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || ((((((((((((((!(s__state == 8481) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || (((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || (((blastFlag <= 2 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (8448 <= s__state && ((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || (((((((((((!(s__state == 8577) && !(s__state == 8593)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8608)) && !(s__state == 8513)) && ((((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__state == 8529)) && !(s__state == 8592)) && !(s__hit == 0))) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8577)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8672) && !(s__state == 8592))) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || ((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (8448 <= s__state && ((((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && !(\old(initial_state) == 8672)) && blastFlag <= 2) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && s__state <= 8576)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((((((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && !(\old(initial_state) == 8672)) && !(s__state == 8528)) && blastFlag <= 3) && !(s__state == 8529)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((8513 == \old(initial_state) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672)) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || 8560 == \old(initial_state)) || \old(initial_state) == 8592) || (((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || 8609 == \old(initial_state)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || s__state <= 3) || 8497 == \old(initial_state)) || (blastFlag <= 3 && !(s__hit == 0))) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8512) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || ((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8577)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497))) || 8448 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8672) && !(s__state == 8592))) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592))) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (8448 <= s__state && ((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || !(s__state == 8672)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || (8448 <= s__state && ((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8529)) && !(s__state == 8512)) && !(s__state == 8544)) && !(s__state == 8576)) && (((((!(\old(initial_state) == 8480) && !(8673 == \old(initial_state))) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8481)) && !(s__state == 8480)) && !(\old(initial_state) == 8672)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (!(s__hit == 0) && ((((((((((!(s__state == 8528) && !(s__state == 8496)) && !(s__state == 8545)) && blastFlag <= 3) && !(s__state == 8529)) && !(s__state == 8512)) && !(s__state == 8544)) && !(s__state == 8576)) && (((((!(\old(initial_state) == 8480) && !(8673 == \old(initial_state))) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8481)) && !(s__state == 8480)) && !(\old(initial_state) == 8672)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((blastFlag <= 2 && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8529) || ((((((((((((((!(s__state == 8529) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 12292)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592)) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8672) && !(s__state == 8592))) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || !(s__state == 8672)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592))) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (((((((((!(s__state == 8577) && blastFlag <= 2) && !(s__state == 8512)) && !(s__state == 8528)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8529)) && 8448 <= s__state) && s__state <= 8672)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || (((((((!(s__state == 8577) && !(s__state == 8512)) && !(s__state == 8528)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8529)) && !(s__hit == 0))) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592))) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || ((((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((8513 == \old(initial_state) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672)) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || ((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 8577)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8672)) || 8560 == \old(initial_state)) || \old(initial_state) == 8592) || (((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || 8609 == \old(initial_state)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || s__state <= 3) || 8497 == \old(initial_state)) || (blastFlag <= 3 && !(s__hit == 0))) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8512) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || (((((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8577)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__hit == 0)) && !(s__state == 8592))) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 3) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(s__hit == 0))) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (8448 <= s__state && ((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 149 locations, 1 error locations. SAFE Result, 42.9s OverallTime, 35 OverallIterations, 25 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 26.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5641 SDtfs, 11627 SDslu, 5971 SDs, 0 SdLazy, 5425 SolverSat, 1453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1065 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3090occurred in iteration=29, 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: 1.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 2364 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 219 NumberOfFragments, 5190 HoareAnnotationTreeSize, 32 FomulaSimplifications, 107354 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 32 FomulaSimplificationsInter, 36819 FormulaSimplificationTreeSizeReductionInter, 23.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 8827 NumberOfCodeBlocks, 8827 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8790 ConstructedInterpolants, 0 QuantifiedInterpolants, 4341440 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1477 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 37743/37821 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...