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_6.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:17:54,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:17:54,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:17:54,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:17:54,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:17:54,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:17:54,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:17:54,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:17:54,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:17:54,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:17:54,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:17:54,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:17:54,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:17:54,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:17:54,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:17:54,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:17:54,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:17:54,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:17:54,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:17:54,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:17:54,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:17:54,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:17:54,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:17:54,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:17:54,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:17:54,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:17:54,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:17:54,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:17:54,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:17:54,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:17:54,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:17:54,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:17:54,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:17:54,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:17:54,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:17:54,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:17:54,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:17:54,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:17:54,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:17:54,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:17:54,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:17:54,504 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-10-02 16:17:54,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:17:54,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:17:54,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:17:54,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:17:54,519 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:17:54,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:17:54,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:17:54,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:17:54,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:17:54,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:17:54,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:17:54,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:17:54,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:17:54,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:17:54,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:17:54,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:17:54,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:17:54,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:17:54,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:17:54,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:17:54,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:17:54,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:17:54,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:17:54,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:17:54,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:17:54,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:17:54,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:17:54,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:17:54,591 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:17:54,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-02 16:17:54,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18daa8892/97a7cfc13c6b4186b82a6f94cc9d529a/FLAGecfb6cdef [2019-10-02 16:17:55,142 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:17:55,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-02 16:17:55,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18daa8892/97a7cfc13c6b4186b82a6f94cc9d529a/FLAGecfb6cdef [2019-10-02 16:17:55,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18daa8892/97a7cfc13c6b4186b82a6f94cc9d529a [2019-10-02 16:17:55,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:17:55,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:17:55,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:17:55,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:17:55,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:17:55,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:17:55" (1/1) ... [2019-10-02 16:17:55,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f66ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:55, skipping insertion in model container [2019-10-02 16:17:55,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:17:55" (1/1) ... [2019-10-02 16:17:55,494 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:17:55,544 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:17:55,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:17:55,887 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:17:56,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:17:56,017 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:17:56,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56 WrapperNode [2019-10-02 16:17:56,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:17:56,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:17:56,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:17:56,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:17:56,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:17:56,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:17:56,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:17:56,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:17:56,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (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-10-02 16:17:56,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:17:56,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:17:56,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-02 16:17:56,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:17:56,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-02 16:17:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:17:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:17:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:17:56,375 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:17:56,989 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-02 16:17:56,990 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-02 16:17:56,994 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:17:56,994 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:17:56,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:56 BoogieIcfgContainer [2019-10-02 16:17:56,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:17:56,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:17:56,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:17:57,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:17:57,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:17:55" (1/3) ... [2019-10-02 16:17:57,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f5479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:57, skipping insertion in model container [2019-10-02 16:17:57,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (2/3) ... [2019-10-02 16:17:57,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f5479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:57, skipping insertion in model container [2019-10-02 16:17:57,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:56" (3/3) ... [2019-10-02 16:17:57,003 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_6.cil-2.c [2019-10-02 16:17:57,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:17:57,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:17:57,032 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:17:57,062 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:17:57,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:17:57,063 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:17:57,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:17:57,063 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:17:57,064 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:17:57,064 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:17:57,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:17:57,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:17:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-02 16:17:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 16:17:57,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:57,097 INFO L411 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-10-02 16:17:57,099 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash 887093352, now seen corresponding path program 1 times [2019-10-02 16:17:57,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:57,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:57,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:57,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:57,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:57,439 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 5 states. [2019-10-02 16:17:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:57,812 INFO L93 Difference]: Finished difference Result 372 states and 644 transitions. [2019-10-02 16:17:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:57,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-02 16:17:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:57,828 INFO L225 Difference]: With dead ends: 372 [2019-10-02 16:17:57,828 INFO L226 Difference]: Without dead ends: 198 [2019-10-02 16:17:57,836 INFO L640 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-10-02 16:17:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-02 16:17:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2019-10-02 16:17:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-02 16:17:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 306 transitions. [2019-10-02 16:17:57,898 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 306 transitions. Word has length 49 [2019-10-02 16:17:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:57,901 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 306 transitions. [2019-10-02 16:17:57,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 306 transitions. [2019-10-02 16:17:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 16:17:57,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:57,904 INFO L411 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-10-02 16:17:57,904 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1023309003, now seen corresponding path program 1 times [2019-10-02 16:17:57,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:57,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,046 INFO L87 Difference]: Start difference. First operand 188 states and 306 transitions. Second operand 5 states. [2019-10-02 16:17:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:58,357 INFO L93 Difference]: Finished difference Result 412 states and 684 transitions. [2019-10-02 16:17:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:58,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-02 16:17:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:58,368 INFO L225 Difference]: With dead ends: 412 [2019-10-02 16:17:58,369 INFO L226 Difference]: Without dead ends: 237 [2019-10-02 16:17:58,371 INFO L640 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-10-02 16:17:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-02 16:17:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2019-10-02 16:17:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-02 16:17:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 379 transitions. [2019-10-02 16:17:58,407 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 379 transitions. Word has length 50 [2019-10-02 16:17:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:58,408 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 379 transitions. [2019-10-02 16:17:58,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 379 transitions. [2019-10-02 16:17:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:17:58,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:58,412 INFO L411 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-10-02 16:17:58,412 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash -141028317, now seen corresponding path program 1 times [2019-10-02 16:17:58,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:58,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:58,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,545 INFO L87 Difference]: Start difference. First operand 227 states and 379 transitions. Second operand 5 states. [2019-10-02 16:17:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:58,811 INFO L93 Difference]: Finished difference Result 472 states and 799 transitions. [2019-10-02 16:17:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:58,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:17:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:58,814 INFO L225 Difference]: With dead ends: 472 [2019-10-02 16:17:58,814 INFO L226 Difference]: Without dead ends: 258 [2019-10-02 16:17:58,816 INFO L640 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-10-02 16:17:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-02 16:17:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-02 16:17:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-02 16:17:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 435 transitions. [2019-10-02 16:17:58,835 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 435 transitions. Word has length 77 [2019-10-02 16:17:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:58,836 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 435 transitions. [2019-10-02 16:17:58,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2019-10-02 16:17:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 16:17:58,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:58,843 INFO L411 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, 1, 1, 1, 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-10-02 16:17:58,844 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1615796808, now seen corresponding path program 1 times [2019-10-02 16:17:58,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:58,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,968 INFO L87 Difference]: Start difference. First operand 258 states and 435 transitions. Second operand 5 states. [2019-10-02 16:17:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,207 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2019-10-02 16:17:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-02 16:17:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,211 INFO L225 Difference]: With dead ends: 542 [2019-10-02 16:17:59,211 INFO L226 Difference]: Without dead ends: 297 [2019-10-02 16:17:59,212 INFO L640 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-10-02 16:17:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-02 16:17:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-02 16:17:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-02 16:17:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-02 16:17:59,228 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-02 16:17:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,231 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-02 16:17:59,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-02 16:17:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 16:17:59,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,233 INFO L411 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, 1, 1, 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-10-02 16:17:59,234 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1136743931, now seen corresponding path program 1 times [2019-10-02 16:17:59,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:59,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:59,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:59,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:59,331 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 5 states. [2019-10-02 16:17:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,567 INFO L93 Difference]: Finished difference Result 578 states and 987 transitions. [2019-10-02 16:17:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-02 16:17:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,570 INFO L225 Difference]: With dead ends: 578 [2019-10-02 16:17:59,571 INFO L226 Difference]: Without dead ends: 297 [2019-10-02 16:17:59,572 INFO L640 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-10-02 16:17:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-02 16:17:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-02 16:17:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-02 16:17:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-10-02 16:17:59,605 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-10-02 16:17:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,605 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-10-02 16:17:59,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-10-02 16:17:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 16:17:59,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,607 INFO L411 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-10-02 16:17:59,607 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2104928583, now seen corresponding path program 1 times [2019-10-02 16:17:59,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:59,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:59,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:59,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:59,670 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 5 states. [2019-10-02 16:17:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,842 INFO L93 Difference]: Finished difference Result 592 states and 1007 transitions. [2019-10-02 16:17:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-02 16:17:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,846 INFO L225 Difference]: With dead ends: 592 [2019-10-02 16:17:59,846 INFO L226 Difference]: Without dead ends: 311 [2019-10-02 16:17:59,847 INFO L640 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-10-02 16:17:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-02 16:17:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-02 16:17:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-02 16:17:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 520 transitions. [2019-10-02 16:17:59,863 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 520 transitions. Word has length 89 [2019-10-02 16:17:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,863 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 520 transitions. [2019-10-02 16:17:59,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 520 transitions. [2019-10-02 16:17:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 16:17:59,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,870 INFO L411 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-10-02 16:17:59,870 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash -281961503, now seen corresponding path program 1 times [2019-10-02 16:17:59,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:59,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:59,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:59,974 INFO L87 Difference]: Start difference. First operand 309 states and 520 transitions. Second operand 5 states. [2019-10-02 16:18:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,142 INFO L93 Difference]: Finished difference Result 607 states and 1025 transitions. [2019-10-02 16:18:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-02 16:18:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,144 INFO L225 Difference]: With dead ends: 607 [2019-10-02 16:18:00,145 INFO L226 Difference]: Without dead ends: 311 [2019-10-02 16:18:00,146 INFO L640 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-10-02 16:18:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-02 16:18:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-02 16:18:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-02 16:18:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 516 transitions. [2019-10-02 16:18:00,158 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 516 transitions. Word has length 90 [2019-10-02 16:18:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,159 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 516 transitions. [2019-10-02 16:18:00,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 516 transitions. [2019-10-02 16:18:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 16:18:00,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,161 INFO L411 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-10-02 16:18:00,161 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1109463774, now seen corresponding path program 1 times [2019-10-02 16:18:00,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 16:18:00,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,217 INFO L87 Difference]: Start difference. First operand 309 states and 516 transitions. Second operand 5 states. [2019-10-02 16:18:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,411 INFO L93 Difference]: Finished difference Result 614 states and 1027 transitions. [2019-10-02 16:18:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-02 16:18:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,414 INFO L225 Difference]: With dead ends: 614 [2019-10-02 16:18:00,414 INFO L226 Difference]: Without dead ends: 318 [2019-10-02 16:18:00,415 INFO L640 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-10-02 16:18:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-02 16:18:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-10-02 16:18:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-02 16:18:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 522 transitions. [2019-10-02 16:18:00,428 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 522 transitions. Word has length 102 [2019-10-02 16:18:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,428 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 522 transitions. [2019-10-02 16:18:00,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 522 transitions. [2019-10-02 16:18:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 16:18:00,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,430 INFO L411 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-10-02 16:18:00,431 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1351505052, now seen corresponding path program 1 times [2019-10-02 16:18:00,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:00,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,482 INFO L87 Difference]: Start difference. First operand 318 states and 522 transitions. Second operand 5 states. [2019-10-02 16:18:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,674 INFO L93 Difference]: Finished difference Result 654 states and 1080 transitions. [2019-10-02 16:18:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-02 16:18:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,677 INFO L225 Difference]: With dead ends: 654 [2019-10-02 16:18:00,677 INFO L226 Difference]: Without dead ends: 349 [2019-10-02 16:18:00,678 INFO L640 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-10-02 16:18:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-02 16:18:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-02 16:18:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-02 16:18:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 569 transitions. [2019-10-02 16:18:00,693 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 569 transitions. Word has length 103 [2019-10-02 16:18:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,694 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 569 transitions. [2019-10-02 16:18:00,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 569 transitions. [2019-10-02 16:18:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 16:18:00,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,696 INFO L411 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-10-02 16:18:00,696 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1217914916, now seen corresponding path program 1 times [2019-10-02 16:18:00,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,747 INFO L87 Difference]: Start difference. First operand 347 states and 569 transitions. Second operand 5 states. [2019-10-02 16:18:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,947 INFO L93 Difference]: Finished difference Result 683 states and 1123 transitions. [2019-10-02 16:18:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 16:18:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,951 INFO L225 Difference]: With dead ends: 683 [2019-10-02 16:18:00,951 INFO L226 Difference]: Without dead ends: 349 [2019-10-02 16:18:00,952 INFO L640 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-10-02 16:18:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-02 16:18:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-02 16:18:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-02 16:18:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2019-10-02 16:18:00,973 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 104 [2019-10-02 16:18:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,975 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2019-10-02 16:18:00,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2019-10-02 16:18:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 16:18:00,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,980 INFO L411 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, 1] [2019-10-02 16:18:00,980 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1213371254, now seen corresponding path program 1 times [2019-10-02 16:18:00,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:01,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,056 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand 5 states. [2019-10-02 16:18:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,266 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2019-10-02 16:18:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-02 16:18:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,269 INFO L225 Difference]: With dead ends: 717 [2019-10-02 16:18:01,269 INFO L226 Difference]: Without dead ends: 383 [2019-10-02 16:18:01,270 INFO L640 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-10-02 16:18:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-02 16:18:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-02 16:18:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-02 16:18:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 607 transitions. [2019-10-02 16:18:01,286 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 607 transitions. Word has length 106 [2019-10-02 16:18:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,286 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 607 transitions. [2019-10-02 16:18:01,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 607 transitions. [2019-10-02 16:18:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 16:18:01,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,288 INFO L411 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, 1] [2019-10-02 16:18:01,289 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1820780382, now seen corresponding path program 1 times [2019-10-02 16:18:01,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,355 INFO L87 Difference]: Start difference. First operand 374 states and 607 transitions. Second operand 5 states. [2019-10-02 16:18:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,542 INFO L93 Difference]: Finished difference Result 744 states and 1212 transitions. [2019-10-02 16:18:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-02 16:18:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,545 INFO L225 Difference]: With dead ends: 744 [2019-10-02 16:18:01,545 INFO L226 Difference]: Without dead ends: 383 [2019-10-02 16:18:01,546 INFO L640 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-10-02 16:18:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-02 16:18:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-02 16:18:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-02 16:18:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 602 transitions. [2019-10-02 16:18:01,562 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 602 transitions. Word has length 107 [2019-10-02 16:18:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,562 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 602 transitions. [2019-10-02 16:18:01,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 602 transitions. [2019-10-02 16:18:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 16:18:01,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,564 INFO L411 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, 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-10-02 16:18:01,564 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1208949664, now seen corresponding path program 1 times [2019-10-02 16:18:01,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 16:18:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,648 INFO L87 Difference]: Start difference. First operand 374 states and 602 transitions. Second operand 5 states. [2019-10-02 16:18:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,849 INFO L93 Difference]: Finished difference Result 772 states and 1247 transitions. [2019-10-02 16:18:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-02 16:18:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,854 INFO L225 Difference]: With dead ends: 772 [2019-10-02 16:18:01,854 INFO L226 Difference]: Without dead ends: 411 [2019-10-02 16:18:01,856 INFO L640 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-10-02 16:18:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-02 16:18:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-02 16:18:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-02 16:18:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 655 transitions. [2019-10-02 16:18:01,876 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 655 transitions. Word has length 115 [2019-10-02 16:18:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,877 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 655 transitions. [2019-10-02 16:18:01,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 655 transitions. [2019-10-02 16:18:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 16:18:01,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,880 INFO L411 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, 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-10-02 16:18:01,880 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 523971907, now seen corresponding path program 1 times [2019-10-02 16:18:01,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 16:18:01,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,958 INFO L87 Difference]: Start difference. First operand 408 states and 655 transitions. Second operand 5 states. [2019-10-02 16:18:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,154 INFO L93 Difference]: Finished difference Result 806 states and 1297 transitions. [2019-10-02 16:18:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-02 16:18:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,157 INFO L225 Difference]: With dead ends: 806 [2019-10-02 16:18:02,157 INFO L226 Difference]: Without dead ends: 411 [2019-10-02 16:18:02,159 INFO L640 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-10-02 16:18:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-02 16:18:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-02 16:18:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-02 16:18:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 652 transitions. [2019-10-02 16:18:02,178 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 652 transitions. Word has length 116 [2019-10-02 16:18:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,178 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 652 transitions. [2019-10-02 16:18:02,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 652 transitions. [2019-10-02 16:18:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 16:18:02,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,181 INFO L411 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, 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-10-02 16:18:02,181 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1148759440, now seen corresponding path program 1 times [2019-10-02 16:18:02,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:02,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:02,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:02,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:02,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:02,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:02,254 INFO L87 Difference]: Start difference. First operand 408 states and 652 transitions. Second operand 5 states. [2019-10-02 16:18:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,551 INFO L93 Difference]: Finished difference Result 851 states and 1363 transitions. [2019-10-02 16:18:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-02 16:18:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,555 INFO L225 Difference]: With dead ends: 851 [2019-10-02 16:18:02,555 INFO L226 Difference]: Without dead ends: 456 [2019-10-02 16:18:02,558 INFO L640 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-10-02 16:18:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-02 16:18:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2019-10-02 16:18:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-02 16:18:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 717 transitions. [2019-10-02 16:18:02,587 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 717 transitions. Word has length 119 [2019-10-02 16:18:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,587 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 717 transitions. [2019-10-02 16:18:02,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 717 transitions. [2019-10-02 16:18:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 16:18:02,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,591 INFO L411 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, 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-10-02 16:18:02,591 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash 669551219, now seen corresponding path program 1 times [2019-10-02 16:18:02,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:18:02,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:02,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:02,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:02,681 INFO L87 Difference]: Start difference. First operand 450 states and 717 transitions. Second operand 5 states. [2019-10-02 16:18:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,955 INFO L93 Difference]: Finished difference Result 897 states and 1434 transitions. [2019-10-02 16:18:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-02 16:18:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,959 INFO L225 Difference]: With dead ends: 897 [2019-10-02 16:18:02,959 INFO L226 Difference]: Without dead ends: 458 [2019-10-02 16:18:02,960 INFO L640 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-10-02 16:18:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-02 16:18:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2019-10-02 16:18:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-02 16:18:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 720 transitions. [2019-10-02 16:18:02,984 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 720 transitions. Word has length 120 [2019-10-02 16:18:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,985 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 720 transitions. [2019-10-02 16:18:02,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 720 transitions. [2019-10-02 16:18:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 16:18:02,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,987 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:02,988 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash 534907766, now seen corresponding path program 1 times [2019-10-02 16:18:02,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 16:18:03,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,073 INFO L87 Difference]: Start difference. First operand 452 states and 720 transitions. Second operand 5 states. [2019-10-02 16:18:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,262 INFO L93 Difference]: Finished difference Result 930 states and 1489 transitions. [2019-10-02 16:18:03,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 16:18:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,266 INFO L225 Difference]: With dead ends: 930 [2019-10-02 16:18:03,266 INFO L226 Difference]: Without dead ends: 491 [2019-10-02 16:18:03,268 INFO L640 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-10-02 16:18:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-02 16:18:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-02 16:18:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-02 16:18:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 755 transitions. [2019-10-02 16:18:03,292 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 755 transitions. Word has length 132 [2019-10-02 16:18:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,292 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 755 transitions. [2019-10-02 16:18:03,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 755 transitions. [2019-10-02 16:18:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 16:18:03,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,295 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:03,295 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 535914030, now seen corresponding path program 1 times [2019-10-02 16:18:03,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 16:18:03,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,352 INFO L87 Difference]: Start difference. First operand 477 states and 755 transitions. Second operand 5 states. [2019-10-02 16:18:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,539 INFO L93 Difference]: Finished difference Result 955 states and 1516 transitions. [2019-10-02 16:18:03,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 16:18:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,543 INFO L225 Difference]: With dead ends: 955 [2019-10-02 16:18:03,543 INFO L226 Difference]: Without dead ends: 491 [2019-10-02 16:18:03,544 INFO L640 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-10-02 16:18:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-02 16:18:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-02 16:18:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-02 16:18:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 747 transitions. [2019-10-02 16:18:03,564 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 747 transitions. Word has length 133 [2019-10-02 16:18:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,564 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 747 transitions. [2019-10-02 16:18:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 747 transitions. [2019-10-02 16:18:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 16:18:03,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,567 INFO L411 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, 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] [2019-10-02 16:18:03,567 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1278605743, now seen corresponding path program 1 times [2019-10-02 16:18:03,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 16:18:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,623 INFO L87 Difference]: Start difference. First operand 477 states and 747 transitions. Second operand 5 states. [2019-10-02 16:18:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,843 INFO L93 Difference]: Finished difference Result 947 states and 1486 transitions. [2019-10-02 16:18:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-02 16:18:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,846 INFO L225 Difference]: With dead ends: 947 [2019-10-02 16:18:03,846 INFO L226 Difference]: Without dead ends: 483 [2019-10-02 16:18:03,847 INFO L640 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-10-02 16:18:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-02 16:18:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-02 16:18:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-02 16:18:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 742 transitions. [2019-10-02 16:18:03,867 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 742 transitions. Word has length 148 [2019-10-02 16:18:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,867 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 742 transitions. [2019-10-02 16:18:03,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 742 transitions. [2019-10-02 16:18:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 16:18:03,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,870 INFO L411 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, 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] [2019-10-02 16:18:03,870 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1353663186, now seen corresponding path program 1 times [2019-10-02 16:18:03,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 16:18:03,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,941 INFO L87 Difference]: Start difference. First operand 477 states and 742 transitions. Second operand 5 states. [2019-10-02 16:18:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,142 INFO L93 Difference]: Finished difference Result 947 states and 1476 transitions. [2019-10-02 16:18:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-02 16:18:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,145 INFO L225 Difference]: With dead ends: 947 [2019-10-02 16:18:04,145 INFO L226 Difference]: Without dead ends: 483 [2019-10-02 16:18:04,146 INFO L640 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-10-02 16:18:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-02 16:18:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-02 16:18:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-02 16:18:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 737 transitions. [2019-10-02 16:18:04,168 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 737 transitions. Word has length 149 [2019-10-02 16:18:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,168 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 737 transitions. [2019-10-02 16:18:04,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 737 transitions. [2019-10-02 16:18:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 16:18:04,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,170 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,171 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1186463222, now seen corresponding path program 1 times [2019-10-02 16:18:04,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-02 16:18:04,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:04,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:04,233 INFO L87 Difference]: Start difference. First operand 477 states and 737 transitions. Second operand 5 states. [2019-10-02 16:18:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,479 INFO L93 Difference]: Finished difference Result 970 states and 1504 transitions. [2019-10-02 16:18:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-02 16:18:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,484 INFO L225 Difference]: With dead ends: 970 [2019-10-02 16:18:04,484 INFO L226 Difference]: Without dead ends: 506 [2019-10-02 16:18:04,486 INFO L640 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-10-02 16:18:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-02 16:18:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-02 16:18:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-02 16:18:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 768 transitions. [2019-10-02 16:18:04,518 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 768 transitions. Word has length 153 [2019-10-02 16:18:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,518 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 768 transitions. [2019-10-02 16:18:04,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 768 transitions. [2019-10-02 16:18:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 16:18:04,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,523 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,523 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 320058782, now seen corresponding path program 1 times [2019-10-02 16:18:04,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-02 16:18:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:04,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:04,608 INFO L87 Difference]: Start difference. First operand 501 states and 768 transitions. Second operand 5 states. [2019-10-02 16:18:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,877 INFO L93 Difference]: Finished difference Result 994 states and 1526 transitions. [2019-10-02 16:18:04,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-02 16:18:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,882 INFO L225 Difference]: With dead ends: 994 [2019-10-02 16:18:04,882 INFO L226 Difference]: Without dead ends: 506 [2019-10-02 16:18:04,884 INFO L640 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-10-02 16:18:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-02 16:18:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-02 16:18:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-02 16:18:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 759 transitions. [2019-10-02 16:18:04,922 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 759 transitions. Word has length 154 [2019-10-02 16:18:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,922 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 759 transitions. [2019-10-02 16:18:04,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 759 transitions. [2019-10-02 16:18:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 16:18:04,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,925 INFO L411 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, 3, 3, 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] [2019-10-02 16:18:04,925 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1626033845, now seen corresponding path program 1 times [2019-10-02 16:18:04,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 16:18:05,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:05,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:05,025 INFO L87 Difference]: Start difference. First operand 501 states and 759 transitions. Second operand 5 states. [2019-10-02 16:18:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,230 INFO L93 Difference]: Finished difference Result 1037 states and 1569 transitions. [2019-10-02 16:18:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:05,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-02 16:18:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,234 INFO L225 Difference]: With dead ends: 1037 [2019-10-02 16:18:05,234 INFO L226 Difference]: Without dead ends: 549 [2019-10-02 16:18:05,236 INFO L640 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-10-02 16:18:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-02 16:18:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2019-10-02 16:18:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 16:18:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 814 transitions. [2019-10-02 16:18:05,262 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 814 transitions. Word has length 159 [2019-10-02 16:18:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:05,262 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 814 transitions. [2019-10-02 16:18:05,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 814 transitions. [2019-10-02 16:18:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 16:18:05,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:05,265 INFO L411 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, 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, 1, 1, 1] [2019-10-02 16:18:05,265 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 885119950, now seen corresponding path program 1 times [2019-10-02 16:18:05,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:05,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 16:18:05,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:05,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:05,323 INFO L87 Difference]: Start difference. First operand 542 states and 814 transitions. Second operand 5 states. [2019-10-02 16:18:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,525 INFO L93 Difference]: Finished difference Result 1078 states and 1622 transitions. [2019-10-02 16:18:05,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:05,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-02 16:18:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,529 INFO L225 Difference]: With dead ends: 1078 [2019-10-02 16:18:05,529 INFO L226 Difference]: Without dead ends: 530 [2019-10-02 16:18:05,530 INFO L640 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-10-02 16:18:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-02 16:18:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2019-10-02 16:18:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-02 16:18:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 784 transitions. [2019-10-02 16:18:05,552 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 784 transitions. Word has length 160 [2019-10-02 16:18:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:05,552 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 784 transitions. [2019-10-02 16:18:05,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 784 transitions. [2019-10-02 16:18:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 16:18:05,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:05,555 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:05,555 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1076584642, now seen corresponding path program 1 times [2019-10-02 16:18:05,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:05,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-02 16:18:05,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:05,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:05,614 INFO L87 Difference]: Start difference. First operand 523 states and 784 transitions. Second operand 5 states. [2019-10-02 16:18:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,841 INFO L93 Difference]: Finished difference Result 1058 states and 1592 transitions. [2019-10-02 16:18:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:05,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-02 16:18:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,844 INFO L225 Difference]: With dead ends: 1058 [2019-10-02 16:18:05,844 INFO L226 Difference]: Without dead ends: 548 [2019-10-02 16:18:05,846 INFO L640 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-10-02 16:18:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-02 16:18:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-10-02 16:18:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 16:18:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2019-10-02 16:18:05,913 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 174 [2019-10-02 16:18:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:05,913 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2019-10-02 16:18:05,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2019-10-02 16:18:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 16:18:05,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:05,916 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:05,916 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 415925946, now seen corresponding path program 1 times [2019-10-02 16:18:05,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-02 16:18:05,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:05,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:05,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:05,994 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand 5 states. [2019-10-02 16:18:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,178 INFO L93 Difference]: Finished difference Result 1079 states and 1605 transitions. [2019-10-02 16:18:06,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:06,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 16:18:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,181 INFO L225 Difference]: With dead ends: 1079 [2019-10-02 16:18:06,181 INFO L226 Difference]: Without dead ends: 546 [2019-10-02 16:18:06,182 INFO L640 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-10-02 16:18:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-02 16:18:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2019-10-02 16:18:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 16:18:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 794 transitions. [2019-10-02 16:18:06,216 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 794 transitions. Word has length 175 [2019-10-02 16:18:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,216 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 794 transitions. [2019-10-02 16:18:06,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 794 transitions. [2019-10-02 16:18:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 16:18:06,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,219 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 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-10-02 16:18:06,219 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1910899715, now seen corresponding path program 1 times [2019-10-02 16:18:06,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 16:18:06,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:06,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:06,272 INFO L87 Difference]: Start difference. First operand 542 states and 794 transitions. Second operand 3 states. [2019-10-02 16:18:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,324 INFO L93 Difference]: Finished difference Result 1593 states and 2335 transitions. [2019-10-02 16:18:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:06,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 16:18:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,330 INFO L225 Difference]: With dead ends: 1593 [2019-10-02 16:18:06,330 INFO L226 Difference]: Without dead ends: 1064 [2019-10-02 16:18:06,332 INFO L640 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-10-02 16:18:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-02 16:18:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 543. [2019-10-02 16:18:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-02 16:18:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 795 transitions. [2019-10-02 16:18:06,362 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 795 transitions. Word has length 190 [2019-10-02 16:18:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,362 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 795 transitions. [2019-10-02 16:18:06,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 795 transitions. [2019-10-02 16:18:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 16:18:06,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,365 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 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-10-02 16:18:06,365 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,365 INFO L82 PathProgramCache]: Analyzing trace with hash 44191041, now seen corresponding path program 1 times [2019-10-02 16:18:06,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 16:18:06,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:06,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:06,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:06,433 INFO L87 Difference]: Start difference. First operand 543 states and 795 transitions. Second operand 3 states. [2019-10-02 16:18:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,557 INFO L93 Difference]: Finished difference Result 1601 states and 2350 transitions. [2019-10-02 16:18:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:06,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 16:18:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,562 INFO L225 Difference]: With dead ends: 1601 [2019-10-02 16:18:06,562 INFO L226 Difference]: Without dead ends: 1071 [2019-10-02 16:18:06,564 INFO L640 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-10-02 16:18:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-02 16:18:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2019-10-02 16:18:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-10-02 16:18:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1553 transitions. [2019-10-02 16:18:06,628 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1553 transitions. Word has length 190 [2019-10-02 16:18:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,629 INFO L475 AbstractCegarLoop]: Abstraction has 1071 states and 1553 transitions. [2019-10-02 16:18:06,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1553 transitions. [2019-10-02 16:18:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 16:18:06,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,633 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-10-02 16:18:06,634 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 402721867, now seen corresponding path program 1 times [2019-10-02 16:18:06,634 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 16:18:06,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:06,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:06,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:06,731 INFO L87 Difference]: Start difference. First operand 1071 states and 1553 transitions. Second operand 3 states. [2019-10-02 16:18:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,888 INFO L93 Difference]: Finished difference Result 2657 states and 3866 transitions. [2019-10-02 16:18:06,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:06,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 16:18:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,896 INFO L225 Difference]: With dead ends: 2657 [2019-10-02 16:18:06,896 INFO L226 Difference]: Without dead ends: 1599 [2019-10-02 16:18:06,898 INFO L640 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-10-02 16:18:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-10-02 16:18:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-10-02 16:18:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-10-02 16:18:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2312 transitions. [2019-10-02 16:18:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2312 transitions. Word has length 192 [2019-10-02 16:18:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,976 INFO L475 AbstractCegarLoop]: Abstraction has 1599 states and 2312 transitions. [2019-10-02 16:18:06,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2312 transitions. [2019-10-02 16:18:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 16:18:06,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,981 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-10-02 16:18:06,981 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1637292960, now seen corresponding path program 1 times [2019-10-02 16:18:06,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 16:18:07,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:07,046 INFO L224 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-10-02 16:18:07,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:07,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:18:07,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 16:18:07,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:18:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:18:07,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:07,233 INFO L87 Difference]: Start difference. First operand 1599 states and 2312 transitions. Second operand 5 states. [2019-10-02 16:18:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:08,158 INFO L93 Difference]: Finished difference Result 5844 states and 8452 transitions. [2019-10-02 16:18:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:18:08,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-02 16:18:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:08,185 INFO L225 Difference]: With dead ends: 5844 [2019-10-02 16:18:08,185 INFO L226 Difference]: Without dead ends: 4214 [2019-10-02 16:18:08,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 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-10-02 16:18:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-10-02 16:18:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 2401. [2019-10-02 16:18:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-10-02 16:18:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3430 transitions. [2019-10-02 16:18:08,434 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3430 transitions. Word has length 193 [2019-10-02 16:18:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:08,435 INFO L475 AbstractCegarLoop]: Abstraction has 2401 states and 3430 transitions. [2019-10-02 16:18:08,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3430 transitions. [2019-10-02 16:18:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 16:18:08,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:08,449 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:08,450 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1013209815, now seen corresponding path program 1 times [2019-10-02 16:18:08,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:08,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:08,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:08,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-10-02 16:18:08,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:08,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:08,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:08,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:08,611 INFO L87 Difference]: Start difference. First operand 2401 states and 3430 transitions. Second operand 3 states. [2019-10-02 16:18:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:09,015 INFO L93 Difference]: Finished difference Result 5343 states and 7650 transitions. [2019-10-02 16:18:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:09,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 16:18:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:09,031 INFO L225 Difference]: With dead ends: 5343 [2019-10-02 16:18:09,032 INFO L226 Difference]: Without dead ends: 2961 [2019-10-02 16:18:09,038 INFO L640 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-10-02 16:18:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2019-10-02 16:18:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2961. [2019-10-02 16:18:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2961 states. [2019-10-02 16:18:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 4224 transitions. [2019-10-02 16:18:09,293 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 4224 transitions. Word has length 292 [2019-10-02 16:18:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:09,294 INFO L475 AbstractCegarLoop]: Abstraction has 2961 states and 4224 transitions. [2019-10-02 16:18:09,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 4224 transitions. [2019-10-02 16:18:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 16:18:09,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:09,317 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:09,318 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1308592103, now seen corresponding path program 1 times [2019-10-02 16:18:09,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:09,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-10-02 16:18:09,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:09,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:09,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:09,482 INFO L87 Difference]: Start difference. First operand 2961 states and 4224 transitions. Second operand 3 states. [2019-10-02 16:18:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:09,786 INFO L93 Difference]: Finished difference Result 6490 states and 9273 transitions. [2019-10-02 16:18:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:09,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 16:18:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:09,815 INFO L225 Difference]: With dead ends: 6490 [2019-10-02 16:18:09,815 INFO L226 Difference]: Without dead ends: 3548 [2019-10-02 16:18:09,821 INFO L640 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-10-02 16:18:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-10-02 16:18:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3548. [2019-10-02 16:18:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3548 states. [2019-10-02 16:18:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 5057 transitions. [2019-10-02 16:18:10,059 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 5057 transitions. Word has length 292 [2019-10-02 16:18:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:10,060 INFO L475 AbstractCegarLoop]: Abstraction has 3548 states and 5057 transitions. [2019-10-02 16:18:10,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 5057 transitions. [2019-10-02 16:18:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 16:18:10,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:10,070 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:10,070 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1060445609, now seen corresponding path program 1 times [2019-10-02 16:18:10,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:10,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:10,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-10-02 16:18:10,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:10,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:10,171 INFO L87 Difference]: Start difference. First operand 3548 states and 5057 transitions. Second operand 3 states. [2019-10-02 16:18:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:10,454 INFO L93 Difference]: Finished difference Result 7633 states and 10900 transitions. [2019-10-02 16:18:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:10,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 16:18:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:10,468 INFO L225 Difference]: With dead ends: 7633 [2019-10-02 16:18:10,468 INFO L226 Difference]: Without dead ends: 4104 [2019-10-02 16:18:10,476 INFO L640 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-10-02 16:18:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2019-10-02 16:18:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4104. [2019-10-02 16:18:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-02 16:18:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5847 transitions. [2019-10-02 16:18:10,703 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5847 transitions. Word has length 292 [2019-10-02 16:18:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:10,704 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 5847 transitions. [2019-10-02 16:18:10,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5847 transitions. [2019-10-02 16:18:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 16:18:10,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:10,714 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:10,714 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1157184789, now seen corresponding path program 1 times [2019-10-02 16:18:10,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-02 16:18:10,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:10,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:10,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:10,875 INFO L87 Difference]: Start difference. First operand 4104 states and 5847 transitions. Second operand 3 states. [2019-10-02 16:18:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:11,186 INFO L93 Difference]: Finished difference Result 8747 states and 12482 transitions. [2019-10-02 16:18:11,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:11,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 16:18:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:11,197 INFO L225 Difference]: With dead ends: 8747 [2019-10-02 16:18:11,197 INFO L226 Difference]: Without dead ends: 4662 [2019-10-02 16:18:11,206 INFO L640 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-10-02 16:18:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2019-10-02 16:18:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 4662. [2019-10-02 16:18:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2019-10-02 16:18:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 6639 transitions. [2019-10-02 16:18:11,438 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 6639 transitions. Word has length 292 [2019-10-02 16:18:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:11,439 INFO L475 AbstractCegarLoop]: Abstraction has 4662 states and 6639 transitions. [2019-10-02 16:18:11,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 6639 transitions. [2019-10-02 16:18:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-02 16:18:11,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:11,457 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:11,457 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -484216244, now seen corresponding path program 1 times [2019-10-02 16:18:11,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 842 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-10-02 16:18:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:11,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:11,796 INFO L87 Difference]: Start difference. First operand 4662 states and 6639 transitions. Second operand 3 states. [2019-10-02 16:18:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:12,189 INFO L93 Difference]: Finished difference Result 12660 states and 17932 transitions. [2019-10-02 16:18:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:12,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2019-10-02 16:18:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:12,211 INFO L225 Difference]: With dead ends: 12660 [2019-10-02 16:18:12,212 INFO L226 Difference]: Without dead ends: 8017 [2019-10-02 16:18:12,222 INFO L640 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-10-02 16:18:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8017 states. [2019-10-02 16:18:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8017 to 8015. [2019-10-02 16:18:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8015 states. [2019-10-02 16:18:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 11299 transitions. [2019-10-02 16:18:12,647 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 11299 transitions. Word has length 440 [2019-10-02 16:18:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:12,648 INFO L475 AbstractCegarLoop]: Abstraction has 8015 states and 11299 transitions. [2019-10-02 16:18:12,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 11299 transitions. [2019-10-02 16:18:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2019-10-02 16:18:12,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:12,727 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:12,728 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash 457587947, now seen corresponding path program 1 times [2019-10-02 16:18:12,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:12,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:12,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1596 proven. 26 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2019-10-02 16:18:12,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:12,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:18:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:13,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:18:13,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1437 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2019-10-02 16:18:13,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:18:13,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:18:13,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:13,434 INFO L87 Difference]: Start difference. First operand 8015 states and 11299 transitions. Second operand 5 states. [2019-10-02 16:18:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:14,374 INFO L93 Difference]: Finished difference Result 18703 states and 26510 transitions. [2019-10-02 16:18:14,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:18:14,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 539 [2019-10-02 16:18:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:14,401 INFO L225 Difference]: With dead ends: 18703 [2019-10-02 16:18:14,401 INFO L226 Difference]: Without dead ends: 9741 [2019-10-02 16:18:14,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:18:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9741 states. [2019-10-02 16:18:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9741 to 7715. [2019-10-02 16:18:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-10-02 16:18:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 10690 transitions. [2019-10-02 16:18:14,929 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 10690 transitions. Word has length 539 [2019-10-02 16:18:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:14,930 INFO L475 AbstractCegarLoop]: Abstraction has 7715 states and 10690 transitions. [2019-10-02 16:18:14,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 10690 transitions. [2019-10-02 16:18:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-10-02 16:18:14,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:14,961 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:14,962 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1914099989, now seen corresponding path program 1 times [2019-10-02 16:18:14,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 2120 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2019-10-02 16:18:15,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:15,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:15,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:15,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:15,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:15,217 INFO L87 Difference]: Start difference. First operand 7715 states and 10690 transitions. Second operand 3 states. [2019-10-02 16:18:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:15,612 INFO L93 Difference]: Finished difference Result 15571 states and 21546 transitions. [2019-10-02 16:18:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:15,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2019-10-02 16:18:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:15,628 INFO L225 Difference]: With dead ends: 15571 [2019-10-02 16:18:15,628 INFO L226 Difference]: Without dead ends: 7875 [2019-10-02 16:18:15,642 INFO L640 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-10-02 16:18:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-10-02 16:18:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 7715. [2019-10-02 16:18:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-10-02 16:18:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 10550 transitions. [2019-10-02 16:18:15,988 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 10550 transitions. Word has length 570 [2019-10-02 16:18:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:15,989 INFO L475 AbstractCegarLoop]: Abstraction has 7715 states and 10550 transitions. [2019-10-02 16:18:15,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 10550 transitions. [2019-10-02 16:18:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-10-02 16:18:16,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:16,011 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:16,011 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1792656750, now seen corresponding path program 1 times [2019-10-02 16:18:16,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:16,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 2121 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2019-10-02 16:18:16,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:16,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:16,362 INFO L87 Difference]: Start difference. First operand 7715 states and 10550 transitions. Second operand 3 states. [2019-10-02 16:18:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:16,725 INFO L93 Difference]: Finished difference Result 15607 states and 21301 transitions. [2019-10-02 16:18:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 584 [2019-10-02 16:18:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:16,740 INFO L225 Difference]: With dead ends: 15607 [2019-10-02 16:18:16,740 INFO L226 Difference]: Without dead ends: 7911 [2019-10-02 16:18:16,754 INFO L640 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-10-02 16:18:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2019-10-02 16:18:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 7715. [2019-10-02 16:18:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-10-02 16:18:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 10444 transitions. [2019-10-02 16:18:17,072 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 10444 transitions. Word has length 584 [2019-10-02 16:18:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:17,072 INFO L475 AbstractCegarLoop]: Abstraction has 7715 states and 10444 transitions. [2019-10-02 16:18:17,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 10444 transitions. [2019-10-02 16:18:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-10-02 16:18:17,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:17,090 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:17,090 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -202161879, now seen corresponding path program 1 times [2019-10-02 16:18:17,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 2362 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2019-10-02 16:18:17,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:17,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:17,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:17,419 INFO L87 Difference]: Start difference. First operand 7715 states and 10444 transitions. Second operand 3 states. [2019-10-02 16:18:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:17,782 INFO L93 Difference]: Finished difference Result 15530 states and 20998 transitions. [2019-10-02 16:18:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:17,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 624 [2019-10-02 16:18:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:17,792 INFO L225 Difference]: With dead ends: 15530 [2019-10-02 16:18:17,792 INFO L226 Difference]: Without dead ends: 7834 [2019-10-02 16:18:17,803 INFO L640 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-10-02 16:18:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2019-10-02 16:18:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 7715. [2019-10-02 16:18:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-10-02 16:18:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 10416 transitions. [2019-10-02 16:18:18,172 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 10416 transitions. Word has length 624 [2019-10-02 16:18:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:18,173 INFO L475 AbstractCegarLoop]: Abstraction has 7715 states and 10416 transitions. [2019-10-02 16:18:18,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 10416 transitions. [2019-10-02 16:18:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-10-02 16:18:18,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:18,187 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:18,187 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1285189009, now seen corresponding path program 1 times [2019-10-02 16:18:18,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:18,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2741 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2019-10-02 16:18:18,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:18,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:18,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:18,625 INFO L87 Difference]: Start difference. First operand 7715 states and 10416 transitions. Second operand 3 states. [2019-10-02 16:18:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:19,057 INFO L93 Difference]: Finished difference Result 11405 states and 15386 transitions. [2019-10-02 16:18:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:19,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2019-10-02 16:18:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:19,067 INFO L225 Difference]: With dead ends: 11405 [2019-10-02 16:18:19,067 INFO L226 Difference]: Without dead ends: 7761 [2019-10-02 16:18:19,073 INFO L640 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-10-02 16:18:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7761 states. [2019-10-02 16:18:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7761 to 7761. [2019-10-02 16:18:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7761 states. [2019-10-02 16:18:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7761 states to 7761 states and 10467 transitions. [2019-10-02 16:18:19,420 INFO L78 Accepts]: Start accepts. Automaton has 7761 states and 10467 transitions. Word has length 653 [2019-10-02 16:18:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:19,421 INFO L475 AbstractCegarLoop]: Abstraction has 7761 states and 10467 transitions. [2019-10-02 16:18:19,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7761 states and 10467 transitions. [2019-10-02 16:18:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-10-02 16:18:19,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:19,435 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:18:19,435 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1509596794, now seen corresponding path program 1 times [2019-10-02 16:18:19,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:19,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:19,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2739 proven. 0 refuted. 0 times theorem prover too weak. 1967 trivial. 0 not checked. [2019-10-02 16:18:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:19,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:19,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:19,836 INFO L87 Difference]: Start difference. First operand 7761 states and 10467 transitions. Second operand 3 states. [2019-10-02 16:18:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:20,105 INFO L93 Difference]: Finished difference Result 11497 states and 15488 transitions. [2019-10-02 16:18:20,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:20,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2019-10-02 16:18:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:20,113 INFO L225 Difference]: With dead ends: 11497 [2019-10-02 16:18:20,113 INFO L226 Difference]: Without dead ends: 7807 [2019-10-02 16:18:20,118 INFO L640 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-10-02 16:18:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2019-10-02 16:18:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 7807. [2019-10-02 16:18:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7807 states. [2019-10-02 16:18:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7807 states to 7807 states and 10518 transitions. [2019-10-02 16:18:20,400 INFO L78 Accepts]: Start accepts. Automaton has 7807 states and 10518 transitions. Word has length 654 [2019-10-02 16:18:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:20,401 INFO L475 AbstractCegarLoop]: Abstraction has 7807 states and 10518 transitions. [2019-10-02 16:18:20,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7807 states and 10518 transitions. [2019-10-02 16:18:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2019-10-02 16:18:20,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:20,418 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 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, 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, 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] [2019-10-02 16:18:20,418 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1872031424, now seen corresponding path program 1 times [2019-10-02 16:18:20,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:20,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11676 backedges. 5840 proven. 0 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2019-10-02 16:18:21,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:21,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:21,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:21,191 INFO L87 Difference]: Start difference. First operand 7807 states and 10518 transitions. Second operand 3 states. [2019-10-02 16:18:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:21,508 INFO L93 Difference]: Finished difference Result 15845 states and 21355 transitions. [2019-10-02 16:18:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:21,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1015 [2019-10-02 16:18:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:21,516 INFO L225 Difference]: With dead ends: 15845 [2019-10-02 16:18:21,516 INFO L226 Difference]: Without dead ends: 8003 [2019-10-02 16:18:21,523 INFO L640 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-10-02 16:18:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2019-10-02 16:18:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 7933. [2019-10-02 16:18:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7933 states. [2019-10-02 16:18:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7933 states to 7933 states and 10629 transitions. [2019-10-02 16:18:21,872 INFO L78 Accepts]: Start accepts. Automaton has 7933 states and 10629 transitions. Word has length 1015 [2019-10-02 16:18:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:21,873 INFO L475 AbstractCegarLoop]: Abstraction has 7933 states and 10629 transitions. [2019-10-02 16:18:21,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7933 states and 10629 transitions. [2019-10-02 16:18:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2019-10-02 16:18:21,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:21,886 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 34, 34, 34, 34, 34, 34, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 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, 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, 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] [2019-10-02 16:18:21,886 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash -567130304, now seen corresponding path program 1 times [2019-10-02 16:18:21,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:21,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12163 backedges. 5892 proven. 0 refuted. 0 times theorem prover too weak. 6271 trivial. 0 not checked. [2019-10-02 16:18:22,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:22,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:22,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:22,619 INFO L87 Difference]: Start difference. First operand 7933 states and 10629 transitions. Second operand 3 states. [2019-10-02 16:18:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:22,946 INFO L93 Difference]: Finished difference Result 15034 states and 20125 transitions. [2019-10-02 16:18:22,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:22,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1045 [2019-10-02 16:18:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:22,947 INFO L225 Difference]: With dead ends: 15034 [2019-10-02 16:18:22,947 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:18:22,964 INFO L640 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-10-02 16:18:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:18:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:18:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:18:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:18:22,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1045 [2019-10-02 16:18:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:22,967 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:18:22,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:18:22,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:18:22,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:18:23,196 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 185 [2019-10-02 16:18:23,361 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 185 [2019-10-02 16:18:23,583 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 182 [2019-10-02 16:18:26,610 WARN L191 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 706 DAG size of output: 423 [2019-10-02 16:18:26,839 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 183 [2019-10-02 16:18:26,946 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 174 [2019-10-02 16:18:29,751 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 707 DAG size of output: 424 [2019-10-02 16:18:30,867 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 296 [2019-10-02 16:18:32,484 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 176 DAG size of output: 97 [2019-10-02 16:18:33,937 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 176 DAG size of output: 97 [2019-10-02 16:18:35,650 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 148 DAG size of output: 113 [2019-10-02 16:18:37,167 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 176 DAG size of output: 101 [2019-10-02 16:18:41,269 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 368 DAG size of output: 92 [2019-10-02 16:18:42,537 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 160 DAG size of output: 107 [2019-10-02 16:18:45,398 WARN L191 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 180 DAG size of output: 104 [2019-10-02 16:18:46,828 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 166 DAG size of output: 97 [2019-10-02 16:18:48,277 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 166 DAG size of output: 97 [2019-10-02 16:18:50,026 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 169 DAG size of output: 115 [2019-10-02 16:18:51,703 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 184 DAG size of output: 144 [2019-10-02 16:18:55,899 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 369 DAG size of output: 92 [2019-10-02 16:18:57,616 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 193 DAG size of output: 138 [2019-10-02 16:18:57,765 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 16:18:59,207 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 178 DAG size of output: 97 [2019-10-02 16:19:00,575 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 149 DAG size of output: 97 [2019-10-02 16:19:01,946 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 207 DAG size of output: 115 [2019-10-02 16:19:02,094 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 16:19:03,573 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 178 DAG size of output: 97 [2019-10-02 16:19:04,700 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 149 DAG size of output: 80 [2019-10-02 16:19:06,365 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 187 DAG size of output: 136 [2019-10-02 16:19:07,940 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 166 DAG size of output: 97 [2019-10-02 16:19:13,771 WARN L191 SmtUtils]: Spent 5.83 s on a formula simplification. DAG size of input: 295 DAG size of output: 156 [2019-10-02 16:19:15,350 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 206 DAG size of output: 107 [2019-10-02 16:19:15,352 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:19:15,353 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:15,353 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:15,353 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:19:15,353 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:19:15,353 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:19:15,353 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 672 683) the Hoare annotation is: true [2019-10-02 16:19:15,353 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 672 683) no Hoare annotation was computed. [2019-10-02 16:19:15,353 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 672 683) no Hoare annotation was computed. [2019-10-02 16:19:15,353 INFO L439 ceAbstractionStarter]: At program point L679(line 679) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L679-1(line 679) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 574) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 606) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 617) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 628) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 639) no Hoare annotation was computed. [2019-10-02 16:19:15,354 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 666) no Hoare annotation was computed. [2019-10-02 16:19:15,355 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 664 666) no Hoare annotation was computed. [2019-10-02 16:19:15,355 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 513) no Hoare annotation was computed. [2019-10-02 16:19:15,355 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 607) the Hoare annotation is: (let ((.cse16 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse7 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse18 (= |ssl3_accept_#in~initial_state| 8592)) (.cse14 (= |ssl3_accept_#in~initial_state| 8561)) (.cse20 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse21 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse9 (= 8576 |ssl3_accept_#in~initial_state|)) (.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse6 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse19 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse15 (= |ssl3_accept_#in~initial_state| 8512)) (.cse10 (= |ssl3_accept_#in~initial_state| 8544)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse13 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse17 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse11 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse8 (= |ssl3_accept_#in~initial_state| 8528)) (.cse12 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse4 (and (not .cse16) (not .cse7) (not .cse18) (not .cse14) (not .cse20) (not .cse21) (not (= ssl3_accept_~s__state~0 8656)) (not .cse9) (not .cse3) (not .cse0) (not .cse6) (not .cse19) (not .cse15) (not .cse10) (not (= ssl3_accept_~s__state~0 8657)) (not .cse2) (not (= ssl3_accept_~s__state~0 12292)) (not .cse13) (not .cse17) (not .cse11) (not .cse1) (not .cse8) (not .cse12))) (.cse5 (<= 8656 ssl3_accept_~s__state~0))) (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (= ssl3_accept_~blastFlag~0 8) .cse5) .cse6 .cse7 .cse8 (and (and (<= ssl3_accept_~blastFlag~0 5) .cse4) .cse5) (and .cse4 .cse5 (= ssl3_accept_~blastFlag~0 7)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5) .cse15 .cse16 .cse17 .cse18 (and .cse4 (= ssl3_accept_~blastFlag~0 9) .cse5) .cse19 .cse20 .cse21 (and (= ssl3_accept_~blastFlag~0 11) .cse4 (= ssl3_accept_~s__hit~0 0) (<= ssl3_accept_~s__state~0 8672) .cse5) (= |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-10-02 16:19:15,355 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 639) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ssl3_accept_~s__state~0 8656))) (.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (not (= ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ssl3_accept_~s__state~0 8673)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_accept_~blastFlag~0 5) .cse4) (= |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 (= ssl3_accept_~blastFlag~0 9)) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and .cse0 .cse1 (= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (= 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 .cse0 (= ssl3_accept_~blastFlag~0 8) .cse1 .cse2 .cse3 .cse4) (= |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 (= ssl3_accept_~blastFlag~0 7) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 547) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 573) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 605) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 616) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 627) no Hoare annotation was computed. [2019-10-02 16:19:15,356 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 638) no Hoare annotation was computed. [2019-10-02 16:19:15,357 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 512) no Hoare annotation was computed. [2019-10-02 16:19:15,357 INFO L439 ceAbstractionStarter]: At program point L403(lines 394 415) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (not (= ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ssl3_accept_~s__state~0 8496))) (.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 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .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 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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-10-02 16:19:15,357 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-10-02 16:19:15,357 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-10-02 16:19:15,357 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-10-02 16:19:15,358 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 605) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (not (= ssl3_accept_~s__state~0 8640)) (= |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-10-02 16:19:15,358 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 617) the Hoare annotation is: (let ((.cse23 (= |ssl3_accept_#in~initial_state| 8656)) (.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8512)) (.cse8 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse6 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse17 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse20 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse5 (= |ssl3_accept_#in~initial_state| 8529)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse19 (= |ssl3_accept_#in~initial_state| 8592)) (.cse12 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse15 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672)) (.cse10 (= 8576 |ssl3_accept_#in~initial_state|)) (.cse24 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse2 (and (not .cse23) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse7) (not .cse16) (not (= ssl3_accept_~s__state~0 8656)) (not .cse8) (and (not .cse6) (not .cse0) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8481)) (not .cse17) (not (= ssl3_accept_~s__state~0 8528)) (not .cse20) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse11) (not .cse5) (not (= ssl3_accept_~s__state~0 8529)) (not .cse14) (not .cse18) (not (= ssl3_accept_~s__state~0 8640)) (not .cse19) (not .cse12) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not .cse1) (not .cse15) (not (= ssl3_accept_~s__state~0 8641)) (not .cse21) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8560)) (not .cse22) (not .cse9) (not .cse13) (not .cse10) (not .cse24) (not (= ssl3_accept_~s__state~0 8592))))) (.cse3 (<= 8448 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8656))) (or .cse0 .cse1 (and (= ssl3_accept_~blastFlag~0 9) .cse2 .cse3 .cse4) .cse5 .cse6 (and (and (<= ssl3_accept_~blastFlag~0 5) .cse2) .cse3 .cse4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 7)) .cse21 .cse22 .cse23 .cse24 (and .cse2 .cse3 (= 6 ssl3_accept_~blastFlag~0) .cse4) (and (= ssl3_accept_~blastFlag~0 8) .cse2 .cse3 .cse4) (= |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-10-02 16:19:15,359 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 628) the Hoare annotation is: (let ((.cse17 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse5 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse19 (= |ssl3_accept_#in~initial_state| 8592)) (.cse23 (= |ssl3_accept_#in~initial_state| 8656)) (.cse15 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse10 (= 8576 |ssl3_accept_#in~initial_state|)) (.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse20 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8512)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse12 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse6 (<= ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ssl3_accept_~s__state~0)) (.cse8 (and (not (= ssl3_accept_~s__state~0 8481)) (not .cse17) (not .cse5) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8672)) (not .cse19) (not .cse23) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not .cse15) (not (= ssl3_accept_~s__state~0 8641)) (not .cse21) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not .cse22) (not (= ssl3_accept_~s__state~0 8656)) (not .cse10) (not .cse3) (not .cse0) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8528)) (not .cse20) (not .cse4) (not (= ssl3_accept_~s__state~0 8545)) (not .cse16) (not (= ssl3_accept_~s__state~0 8480)) (not .cse11) (not (= ssl3_accept_~s__state~0 8657)) (not .cse2) (not (= ssl3_accept_~s__state~0 12292)) (not .cse14) (not .cse18) (not (= ssl3_accept_~s__state~0 8577)) (not (= ssl3_accept_~s__state~0 8640)) (not .cse12) (not .cse1) (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 .cse9) (not .cse13) (not (= ssl3_accept_~s__state~0 8592))))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 (= 6 ssl3_accept_~blastFlag~0) .cse8) (and .cse6 (= ssl3_accept_~blastFlag~0 8) .cse7 .cse8) .cse9 .cse10 (and .cse6 .cse7 .cse8 (= ssl3_accept_~blastFlag~0 7)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and (and (<= ssl3_accept_~blastFlag~0 5) .cse6 .cse8) .cse7) .cse21 .cse22 .cse23 (and .cse6 (= ssl3_accept_~blastFlag~0 9) .cse7 .cse8) (= 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-10-02 16:19:15,359 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 546) no Hoare annotation was computed. [2019-10-02 16:19:15,359 INFO L439 ceAbstractionStarter]: At program point L603(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (= ssl3_accept_~blastFlag~0 8) (= 8560 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 5) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= ssl3_accept_~blastFlag~0 7) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= ssl3_accept_~blastFlag~0 9) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8481) (and (<= 8448 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8448) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= 12 ssl3_accept_~blastFlag~0))) (= 8657 |ssl3_accept_#in~initial_state|) (and (= ssl3_accept_~blastFlag~0 10) (<= ssl3_accept_~s__state~0 8656) .cse1 .cse0) (<= ssl3_accept_~s__state~0 3) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (= ssl3_accept_~blastFlag~0 11) (not (= ssl3_accept_~s__state~0 8656)) .cse1 .cse0 (not (= ssl3_accept_~s__state~0 8657)) (<= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8512) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577))) [2019-10-02 16:19:15,359 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 572) no Hoare annotation was computed. [2019-10-02 16:19:15,359 INFO L443 ceAbstractionStarter]: For program point L570-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,359 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 605) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (not (= ssl3_accept_~s__state~0 8640)) (= |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-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 615) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 626) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 637) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 511) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L505-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,360 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L472-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L406-2(lines 402 415) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 671) the Hoare annotation is: true [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 545) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-02 16:19:15,361 INFO L443 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 614) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 625) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 636) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 656) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 510) no Hoare annotation was computed. [2019-10-02 16:19:15,362 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-10-02 16:19:15,363 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 638) the Hoare annotation is: (let ((.cse33 (not (= ssl3_accept_~s__state~0 8481))) (.cse11 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse6 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse34 (not (= ssl3_accept_~s__state~0 8529))) (.cse0 (not (= ssl3_accept_~s__state~0 8672))) (.cse12 (= |ssl3_accept_#in~initial_state| 8592)) (.cse31 (= |ssl3_accept_#in~initial_state| 8656)) (.cse35 (not (= ssl3_accept_~s__state~0 8561))) (.cse36 (not (= ssl3_accept_~s__state~0 8448))) (.cse10 (= |ssl3_accept_#in~initial_state| 8561)) (.cse37 (not (= ssl3_accept_~s__state~0 8641))) (.cse30 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse38 (not (= ssl3_accept_~s__state~0 8544))) (.cse39 (not (= ssl3_accept_~s__state~0 8608))) (.cse13 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse1 (not (= ssl3_accept_~s__state~0 8656))) (.cse7 (= 8576 |ssl3_accept_#in~initial_state|)) (.cse18 (= |ssl3_accept_#in~initial_state| 8641)) (.cse15 (= |ssl3_accept_#in~initial_state| 8480)) (.cse40 (not (= ssl3_accept_~s__state~0 8593))) (.cse41 (not (= ssl3_accept_~s__state~0 8528))) (.cse42 (not (= ssl3_accept_~s__state~0 8496))) (.cse29 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse19 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse43 (not (= ssl3_accept_~s__state~0 8545))) (.cse26 (= |ssl3_accept_#in~initial_state| 8512)) (.cse44 (not (= ssl3_accept_~s__state~0 8480))) (.cse8 (= |ssl3_accept_#in~initial_state| 8544)) (.cse3 (not (= ssl3_accept_~s__state~0 8657))) (.cse17 (= |ssl3_accept_#in~initial_state| 8529)) (.cse54 (= |ssl3_accept_#in~initial_state| 8481)) (.cse23 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse28 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse45 (not (= ssl3_accept_~s__state~0 8577))) (.cse46 (not (= ssl3_accept_~s__state~0 8640))) (.cse21 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8593)) (.cse47 (not (= ssl3_accept_~s__state~0 8512))) (.cse48 (not (= ssl3_accept_~s__state~0 8609))) (.cse5 (not (= ssl3_accept_~s__state~0 8673))) (.cse49 (not (= ssl3_accept_~s__state~0 8576))) (.cse50 (not (= ssl3_accept_~s__state~0 8560))) (.cse51 (not (= ssl3_accept_~s__state~0 8513))) (.cse52 (not (= ssl3_accept_~s__state~0 8497))) (.cse14 (= |ssl3_accept_#in~initial_state| 8496)) (.cse20 (= |ssl3_accept_#in~initial_state| 8528)) (.cse22 (= |ssl3_accept_#in~initial_state| 8672)) (.cse32 (= 8545 |ssl3_accept_#in~initial_state|)) (.cse53 (not (= ssl3_accept_~s__state~0 8592)))) (let ((.cse9 (= ssl3_accept_~blastFlag~0 9)) (.cse27 (= 6 ssl3_accept_~blastFlag~0)) (.cse24 (= ssl3_accept_~blastFlag~0 8)) (.cse4 (<= ssl3_accept_~blastFlag~0 5)) (.cse25 (and .cse33 (not .cse11) (not .cse6) .cse34 .cse0 (not .cse12) (not .cse31) .cse35 .cse36 (not .cse10) .cse37 (not .cse30) .cse38 .cse39 (not .cse13) .cse1 (not .cse7) (not .cse18) (not .cse15) .cse40 .cse41 .cse42 (not .cse29) (not .cse19) .cse43 (not .cse26) .cse44 (not .cse8) .cse3 (not .cse17) (not (= ssl3_accept_~s__state~0 12292)) (not .cse54) (not .cse23) (not .cse28) .cse45 .cse46 (not .cse21) (not .cse16) .cse47 .cse48 .cse5 .cse49 .cse50 .cse51 .cse52 (not .cse14) (not .cse20) (not .cse22) (not .cse32) .cse53)) (.cse55 (= ssl3_accept_~blastFlag~0 7)) (.cse2 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse24 .cse25) .cse26 (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5) .cse28 (and .cse9 .cse25) .cse29 (and .cse25 .cse27) .cse30 (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse5) .cse31 .cse32 (and (and .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse1 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse4 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (<= ssl3_accept_~s__state~0 8656)) .cse54 (and .cse25 .cse55) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (and .cse55 .cse0 .cse1 .cse2 .cse3 .cse5)))) [2019-10-02 16:19:15,364 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 615) the Hoare annotation is: (let ((.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8512)) (.cse6 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse17 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse20 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse19 (= |ssl3_accept_#in~initial_state| 8592)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse15 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse8 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse12 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672)) (.cse10 (= 8576 |ssl3_accept_#in~initial_state|))) (let ((.cse3 (and (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not .cse7) (not .cse16) (and (not .cse6) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse17) (not .cse20) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse11) (not .cse14) (not .cse18) (not (= ssl3_accept_~s__state~0 8640)) (not .cse19) (not (= ssl3_accept_~s__state~0 8561)) (not .cse1) (not (= ssl3_accept_~s__state~0 8448)) (not .cse15) (not (= ssl3_accept_~s__state~0 8641)) (not .cse21) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8560)) (not .cse22)) (not .cse8) (not .cse2) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8577)) (not .cse12) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8576)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse9) (not .cse13) (not (= ssl3_accept_~s__state~0 8656)) (not .cse10))) (.cse4 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (<= ssl3_accept_~s__state~0 8656))) (or .cse0 .cse1 .cse2 (and (= ssl3_accept_~blastFlag~0 9) .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 (and (and (<= ssl3_accept_~blastFlag~0 5) .cse3) .cse4 .cse5) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (= ssl3_accept_~blastFlag~0 8) .cse3 .cse4 .cse5) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 7)) (and .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5) (= |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-10-02 16:19:15,364 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 626) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (not (= ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ssl3_accept_~s__state~0 8560))) (.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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 6 ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (= 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 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 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 .cse9 (<= ssl3_accept_~blastFlag~0 5) .cse10 .cse11 .cse12 .cse13))) [2019-10-02 16:19:15,364 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 655) no Hoare annotation was computed. [2019-10-02 16:19:15,364 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 544) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L439 ceAbstractionStarter]: At program point L509(lines 72 670) 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-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L542-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 641 655) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 613) no Hoare annotation was computed. [2019-10-02 16:19:15,365 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 624) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 635) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 646) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 612) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 623) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 634) no Hoare annotation was computed. [2019-10-02 16:19:15,366 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 584) no Hoare annotation was computed. [2019-10-02 16:19:15,367 INFO L443 ceAbstractionStarter]: For program point L580-2(lines 580 584) no Hoare annotation was computed. [2019-10-02 16:19:15,367 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-10-02 16:19:15,367 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 613) 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 8641))) (.cse5 (<= 8448 ssl3_accept_~s__state~0)) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (<= ssl3_accept_~s__state~0 8656)) (.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 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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ssl3_accept_~blastFlag~0 9) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ssl3_accept_~blastFlag~0 5) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (= |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 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 8) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (= 8608 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 6 ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .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-10-02 16:19:15,368 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 624) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse4 (not (= ssl3_accept_~s__state~0 8544))) (.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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ssl3_accept_~blastFlag~0 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 .cse0 .cse1 .cse2 (= ssl3_accept_~blastFlag~0 8) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (= |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|) (and .cse0 (= ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L449-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 611) no Hoare annotation was computed. [2019-10-02 16:19:15,368 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 622) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 633) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L484-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 634) 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 (<= 8448 ssl3_accept_~s__state~0)) (.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 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|) (and .cse0 .cse1 .cse2 (= ssl3_accept_~blastFlag~0 8) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |ssl3_accept_#in~initial_state| 8528) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ssl3_accept_~blastFlag~0 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-10-02 16:19:15,369 INFO L443 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 671) no Hoare annotation was computed. [2019-10-02 16:19:15,370 INFO L439 ceAbstractionStarter]: At program point L354(lines 330 375) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse4 (not (= ssl3_accept_~s__state~0 8544))) (.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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ssl3_accept_~blastFlag~0 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 .cse0 .cse1 .cse2 (= ssl3_accept_~blastFlag~0 8) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (= |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|) (and .cse0 (= ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |ssl3_accept_#in~initial_state| 8577) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 610) no Hoare annotation was computed. [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 621) no Hoare annotation was computed. [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 632) no Hoare annotation was computed. [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 670) no Hoare annotation was computed. [2019-10-02 16:19:15,371 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 556) no Hoare annotation was computed. [2019-10-02 16:19:15,372 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 611) the Hoare annotation is: (let ((.cse2 (not (= ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.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 8577))) (.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))) (.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__state~0 8656))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ssl3_accept_~blastFlag~0 5) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (= |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 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 8) .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (= |ssl3_accept_#in~initial_state| 8544) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (and .cse2 .cse3 (= ssl3_accept_~blastFlag~0 7) .cse4 .cse5 .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .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|) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse1 .cse6 .cse7 .cse8 (= 6 ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (= |ssl3_accept_#in~initial_state| 8656) (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ssl3_accept_~blastFlag~0 9) .cse21) .cse0 .cse1) (= 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-10-02 16:19:15,372 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 622) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (not (= ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ssl3_accept_~s__state~0 8496))) (.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 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .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 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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-10-02 16:19:15,372 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 632) 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) (= |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 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (= |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 5) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (= |ssl3_accept_#in~initial_state| 8561) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ssl3_accept_~blastFlag~0 9)) (= |ssl3_accept_#in~initial_state| 8512) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ssl3_accept_~s__hit~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (= 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 .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (= |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-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 467) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 671) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 609) no Hoare annotation was computed. [2019-10-02 16:19:15,373 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 620) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 631) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L439 ceAbstractionStarter]: At program point L391(lines 382 417) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (not (= ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ssl3_accept_~s__state~0 8496))) (.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 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .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 5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ssl3_accept_~blastFlag~0 9)) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 602) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L590(lines 590 596) no Hoare annotation was computed. [2019-10-02 16:19:15,374 INFO L443 ceAbstractionStarter]: For program point L590-1(lines 590 596) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 461) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L459-2(lines 457 467) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 608) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 619) no Hoare annotation was computed. [2019-10-02 16:19:15,375 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 630) no Hoare annotation was computed. [2019-10-02 16:19:15,376 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-10-02 16:19:15,376 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-10-02 16:19:15,376 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 609) the Hoare annotation is: (let ((.cse17 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse8 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse19 (= |ssl3_accept_#in~initial_state| 8592)) (.cse23 (= |ssl3_accept_#in~initial_state| 8656)) (.cse15 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse10 (= 8576 |ssl3_accept_#in~initial_state|)) (.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse20 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8512)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse12 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672)) (.cse24 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse5 (and (not .cse17) (not .cse8) (not (= ssl3_accept_~s__state~0 8672)) (not .cse19) (not .cse23) (not .cse15) (not .cse21) (not .cse22) (not .cse10) (not .cse3) (not .cse0) (not .cse7) (not .cse20) (not .cse16) (not .cse11) (not .cse2) (not (= ssl3_accept_~s__state~0 12292)) (not .cse14) (not .cse18) (not .cse12) (not .cse1) (not (= ssl3_accept_~s__state~0 8673)) (not .cse9) (not .cse13) (not .cse24))) (.cse6 (<= 8656 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (and .cse5 (= 6 ssl3_accept_~blastFlag~0) .cse6)) .cse7 .cse8 .cse9 .cse10 (and (and (= ssl3_accept_~blastFlag~0 8) .cse5 .cse6) .cse4) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse4 (and (= ssl3_accept_~blastFlag~0 9) .cse5 .cse6)) .cse20 (and (= ssl3_accept_~s__hit~0 0) (= ssl3_accept_~blastFlag~0 10) (<= ssl3_accept_~s__state~0 8656) .cse6) .cse21 .cse22 (and (and .cse5 .cse6 (= ssl3_accept_~blastFlag~0 7)) .cse4) .cse23 .cse24 (and (and (and (<= ssl3_accept_~blastFlag~0 5) .cse5) .cse6) .cse4) (= |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-10-02 16:19:15,377 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 620) 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 8448))) (.cse3 (<= 8448 ssl3_accept_~s__state~0)) (.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 8480))) (.cse8 (not (= ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ssl3_accept_~s__state~0 8512))) (.cse10 (not (= ssl3_accept_~s__state~0 8576))) (.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|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (= |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 (= ssl3_accept_~blastFlag~0 8) .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|) (= 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 9)) (= |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 5) .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-10-02 16:19:15,377 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-10-02 16:19:15,377 INFO L446 ceAbstractionStarter]: At program point L659(lines 98 660) the Hoare annotation is: true [2019-10-02 16:19:15,377 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 595) no Hoare annotation was computed. [2019-10-02 16:19:15,377 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-10-02 16:19:15,377 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 575) no Hoare annotation was computed. [2019-10-02 16:19:15,377 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 531) no Hoare annotation was computed. [2019-10-02 16:19:15,378 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 607) no Hoare annotation was computed. [2019-10-02 16:19:15,378 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 618) no Hoare annotation was computed. [2019-10-02 16:19:15,378 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 629) no Hoare annotation was computed. [2019-10-02 16:19:15,378 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (= ssl3_accept_~blastFlag~0 8) (= 8560 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 5) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= ssl3_accept_~blastFlag~0 7) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= ssl3_accept_~blastFlag~0 9) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8481) (and (<= 8448 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8448) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= 12 ssl3_accept_~blastFlag~0))) (= 8657 |ssl3_accept_#in~initial_state|) (and (= ssl3_accept_~blastFlag~0 10) (<= ssl3_accept_~s__state~0 8656) .cse1 .cse0) (<= ssl3_accept_~s__state~0 3) (= 8576 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (= ssl3_accept_~blastFlag~0 11) (not (= ssl3_accept_~s__state~0 8656)) .cse1 .cse0 (not (= ssl3_accept_~s__state~0 8657)) (<= ssl3_accept_~s__state~0 8672)) (= |ssl3_accept_#in~initial_state| 8512) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8577))) [2019-10-02 16:19:15,378 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 514) no Hoare annotation was computed. [2019-10-02 16:19:15,378 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-10-02 16:19:15,379 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 618) the Hoare annotation is: (let ((.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__state~0 8448))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (= ssl3_accept_~blastFlag~0 7) .cse0 .cse1) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (and (not (= ssl3_accept_~s__state~0 8481)) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8561)) (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)) (= ssl3_accept_~s__hit~0 0) (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)) (= 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 (= ssl3_accept_~blastFlag~0 8) .cse0 .cse1) (= 8640 |ssl3_accept_#in~initial_state|) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 9)) (= |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 .cse0 .cse1 (= 6 ssl3_accept_~blastFlag~0)) (= |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 (<= ssl3_accept_~blastFlag~0 5)))) [2019-10-02 16:19:15,379 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 631) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse5 (not (= ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ssl3_accept_~s__state~0 8512))) (.cse11 (not (= ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ssl3_accept_~s__state~0 8560))) (.cse13 (not (= ssl3_accept_~s__state~0 8513))) (.cse14 (not (= ssl3_accept_~s__state~0 8497))) (.cse15 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ssl3_accept_~blastFlag~0 5) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= |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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 6 ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= |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 .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 8) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 7) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= 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 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ssl3_accept_~blastFlag~0 9)))) [2019-10-02 16:19:15,379 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 16:19:15,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:19:15 BoogieIcfgContainer [2019-10-02 16:19:15,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:19:15,466 INFO L168 Benchmark]: Toolchain (without parser) took 79989.80 ms. Allocated memory was 133.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 89.4 MB in the beginning and 532.3 MB in the end (delta: -442.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,466 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.57 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 89.2 MB in the beginning and 173.9 MB in the end (delta: -84.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,468 INFO L168 Benchmark]: Boogie Preprocessor took 55.92 ms. Allocated memory is still 201.9 MB. Free memory was 173.9 MB in the beginning and 171.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,468 INFO L168 Benchmark]: RCFGBuilder took 920.52 ms. Allocated memory is still 201.9 MB. Free memory was 171.4 MB in the beginning and 116.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,469 INFO L168 Benchmark]: TraceAbstraction took 78467.67 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 116.0 MB in the beginning and 532.3 MB in the end (delta: -416.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-10-02 16:19:15,472 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.40 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 538.57 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 89.2 MB in the beginning and 173.9 MB in the end (delta: -84.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.92 ms. Allocated memory is still 201.9 MB. Free memory was 173.9 MB in the beginning and 171.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 920.52 ms. Allocated memory is still 201.9 MB. Free memory was 171.4 MB in the beginning and 116.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78467.67 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 116.0 MB in the beginning and 532.3 MB in the end (delta: -416.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && 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)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || \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 == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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) && blastFlag == 9)) || \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)) || ((((((((((((((!(s__state == 8481) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || \old(initial_state) == 8577) || \old(initial_state) == 8496) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(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) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && 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)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || \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 == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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) && blastFlag == 9)) || \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)) || ((((((((((((((!(s__state == 8481) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || \old(initial_state) == 8577) || \old(initial_state) == 8496) || ((((((((((((((!(s__state == 8481) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(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) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && s__state <= 8656) && !(s__state == 8656)) && !(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 == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && blastFlag == 9) && !(s__state == 8592))) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && s__state <= 8656) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8577)) && !(s__state == 8640)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(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) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && blastFlag == 8) && 8448 <= s__state) && !(s__state == 8544)) && s__state <= 8656) && !(s__state == 8656)) && !(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 == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || 8608 == \old(initial_state)) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && s__state <= 8656) && !(s__state == 8656)) && 6 == blastFlag) && !(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 == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && 8448 <= s__state) && !(s__state == 8544)) && s__state <= 8656) && !(s__state == 8656)) && !(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 == 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: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((((!(s__state == 8481) && !(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 == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && 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)) || ((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(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) == 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) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || ((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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 == \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)) && 8448 <= s__state) && !(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) && blastFlag == 9) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8513 == \old(initial_state) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || blastFlag == 8) || 8560 == \old(initial_state)) || 8609 == \old(initial_state)) || 6 == blastFlag) || blastFlag <= 5) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || blastFlag == 7) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || 8608 == \old(initial_state)) || blastFlag == 9) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || ((8448 <= s__state && s__state <= 8448) && (s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && 12 == blastFlag)) || 8657 == \old(initial_state)) || (((blastFlag == 10 && s__state <= 8656) && 8656 <= s__state) && s__hit == 0)) || s__state <= 3) || 8576 == \old(initial_state)) || \old(initial_state) == 8592) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || (((((blastFlag == 11 && !(s__state == 8656)) && 8656 <= s__state) && s__hit == 0) && !(s__state == 8657)) && s__state <= 8672)) || \old(initial_state) == 8512) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state)) || \old(initial_state) == 8577 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((blastFlag == 7 && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || (((((((((((((((!(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__hit == 0) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 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) || ((blastFlag == 8 && 8448 <= s__state) && s__state <= 8448)) || 8640 == \old(initial_state)) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 9)) || \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)) || ((8448 <= s__state && s__state <= 8448) && 6 == blastFlag)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496) || ((8448 <= s__state && s__state <= 8448) && blastFlag <= 5) - 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)) || (((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(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) == 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 <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || (((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && !(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) == 8561) || (((((((((((((((!(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) && blastFlag == 9)) || \old(initial_state) == 8512) || (((((((((((((((!(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__hit == 0) && !(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)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && 6 == blastFlag) && !(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) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 382]: 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 == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || 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 == 8448)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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) && blastFlag == 9)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && 6 == blastFlag) && !(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: 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) || \old(initial_state) == 8512) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || 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 == 8448)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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) && blastFlag == 9)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && 6 == blastFlag) && !(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) || ((8448 <= s__state && s__state <= 8656) && (((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(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 == 8577)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(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)) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && s__state <= 8656) && !(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 == 8577)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && s__state <= 8656) && !(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 == 8577)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(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)) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && s__state <= 8656) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && 6 == blastFlag) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8577)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || \old(initial_state) == 8656) || ((((((((((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(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 == 8577)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && blastFlag == 9) && !(s__state == 8592)) && 8448 <= s__state) && s__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) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || (((s__state <= 8576 && 8448 <= s__state) && 6 == blastFlag) && (((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8592))) || (((s__state <= 8576 && blastFlag == 8) && 8448 <= s__state) && (((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8592))) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || (((s__state <= 8576 && 8448 <= s__state) && (((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8592)) && blastFlag == 7)) || \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)) || (((blastFlag <= 5 && s__state <= 8576) && (((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8592)) && 8448 <= s__state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || (((s__state <= 8576 && blastFlag == 9) && 8448 <= s__state) && (((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8592))) || 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) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || blastFlag == 8) || 8560 == \old(initial_state)) || 8609 == \old(initial_state)) || 6 == blastFlag) || blastFlag <= 5) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || blastFlag == 7) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || 8608 == \old(initial_state)) || blastFlag == 9) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || ((8448 <= s__state && s__state <= 8448) && (s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && 12 == blastFlag)) || 8657 == \old(initial_state)) || (((blastFlag == 10 && s__state <= 8656) && 8656 <= s__state) && s__hit == 0)) || s__state <= 3) || 8576 == \old(initial_state)) || \old(initial_state) == 8592) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || (((((blastFlag == 11 && !(s__state == 8656)) && 8656 <= s__state) && s__hit == 0) && !(s__state == 8657)) && s__state <= 8672)) || \old(initial_state) == 8512) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state)) || \old(initial_state) == 8577 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (((blastFlag == 9 && ((((((((!(\old(initial_state) == 8656) && !(s__state == 8512)) && !(s__state == 8496)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(s__state == 8656)) && !(8513 == \old(initial_state))) && (((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8576 == \old(initial_state))) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 8448 <= s__state) && s__state <= 8656)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || (((blastFlag <= 5 && ((((((((!(\old(initial_state) == 8656) && !(s__state == 8512)) && !(s__state == 8496)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(s__state == 8656)) && !(8513 == \old(initial_state))) && (((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8576 == \old(initial_state))) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 8448 <= s__state) && s__state <= 8656)) || 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)) || ((((((((((((!(\old(initial_state) == 8656) && !(s__state == 8512)) && !(s__state == 8496)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(s__state == 8656)) && !(8513 == \old(initial_state))) && (((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8576 == \old(initial_state))) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 8448 <= s__state) && s__state <= 8656) && blastFlag == 7)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((!(\old(initial_state) == 8656) && !(s__state == 8512)) && !(s__state == 8496)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(s__state == 8656)) && !(8513 == \old(initial_state))) && (((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8576 == \old(initial_state))) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 8448 <= s__state) && 6 == blastFlag) && s__state <= 8656)) || (((blastFlag == 8 && ((((((((!(\old(initial_state) == 8656) && !(s__state == 8512)) && !(s__state == 8496)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(s__state == 8656)) && !(8513 == \old(initial_state))) && (((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(8673 == \old(initial_state))) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8576 == \old(initial_state))) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 8448 <= s__state) && s__state <= 8656)) || \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) || !(s__state == 8640)) || \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: 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)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \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 == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8576)) && !(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)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && blastFlag == 9)) || \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 == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 117]: 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)) || ((((((((((((((!(s__state == 8529) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 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) == 8528) || ((((((((((((((!(s__state == 8529) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || ((((((((((((((!(s__state == 8529) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(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) == 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 == 8529) && blastFlag == 7) && !(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)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || ((((((((((((((!(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) && blastFlag == 9)) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || (s__state <= 8672 && (((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && 6 == blastFlag) && 8656 <= s__state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || (((blastFlag == 8 && (((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && 8656 <= s__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) || (s__state <= 8672 && (blastFlag == 9 && (((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && 8656 <= s__state)) || 8608 == \old(initial_state)) || (((s__hit == 0 && blastFlag == 10) && s__state <= 8656) && 8656 <= s__state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && 8656 <= s__state) && blastFlag == 7) && s__state <= 8672)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (((blastFlag <= 5 && (((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && 8656 <= s__state) && s__state <= 8672)) || \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) || !(s__state == 8640)) || \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: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && 6 == blastFlag) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || \old(initial_state) == 8528) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || ((((((((((((((!(s__state == 8481) && !(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 == 8480)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && blastFlag == 9)) || 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) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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 == \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)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || (((((!(s__state == 8672) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && blastFlag <= 5) && !(s__state == 8673))) || \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 == 8672) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673)) && blastFlag == 9)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((!(s__state == 8672) && !(s__state == 8656)) && 6 == blastFlag) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673))) || 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 == 8672) && blastFlag == 8) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673))) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || \old(initial_state) == 8496) || (((((blastFlag == 7 && !(s__state == 8672)) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || (((blastFlag == 9 && ((((((((((((((((!(s__state == 8528) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(s__state == 8577)) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && 8448 <= s__state) && s__state <= 8656)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || (((blastFlag <= 5 && ((((((((((((((((!(s__state == 8528) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(s__state == 8577)) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && 8448 <= s__state) && s__state <= 8656)) || \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) || (((blastFlag == 8 && ((((((((((((((((!(s__state == 8528) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(s__state == 8577)) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && 8448 <= s__state) && s__state <= 8656)) || \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 == 8528) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(s__state == 8577)) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && 8448 <= s__state) && s__state <= 8656) && blastFlag == 7)) || ((((((((((((((((((((!(s__state == 8528) && !(s__state == 8496)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8512)) && (((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(8609 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 8529)) && !(s__state == 8577)) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && 8448 <= s__state) && 6 == blastFlag) && s__state <= 8656)) || \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 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((!(s__state == 8672) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && blastFlag <= 5) && !(s__state == 8673)) || 8513 == \old(initial_state)) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || (((((!(s__state == 8672) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673)) && blastFlag == 9)) || \old(initial_state) == 8561) || 8560 == \old(initial_state)) || \old(initial_state) == 8592) || 8609 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || (blastFlag == 8 && ((((((((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592))) || \old(initial_state) == 8512) || (((((!(s__state == 8672) && !(s__state == 8656)) && 6 == blastFlag) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673))) || 12292 == \old(initial_state)) || (blastFlag == 9 && ((((((((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592))) || 8608 == \old(initial_state)) || ((((((((((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 6 == blastFlag)) || 8448 == \old(initial_state)) || (((((!(s__state == 8672) && blastFlag == 8) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673))) || \old(initial_state) == 8656) || 8545 == \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)) && !(s__state == 8577)) && !(s__state == 8640)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592)) && s__state <= 8656)) || \old(initial_state) == 8481) || ((((((((((((((((((((((((((((((((((((((((((((((((((!(s__state == 8481) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(s__state == 8672)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8608)) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8577)) && !(s__state == 8640)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && blastFlag == 7)) || 8657 == \old(initial_state)) || \old(initial_state) == 8577) || (((((blastFlag == 7 && !(s__state == 8672)) && !(s__state == 8656)) && 8656 <= s__state) && !(s__state == 8657)) && !(s__state == 8673)) - InvariantResult [Line: 394]: 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 == 8561)) && !(s__state == 8448)) && blastFlag == 8) && 8448 <= s__state) && !(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)) || 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 == 8448)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8480)) && blastFlag <= 5) && !(s__state == 8512)) && !(s__state == 8576)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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) && blastFlag == 9)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && blastFlag == 7) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(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)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && 6 == blastFlag) && !(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: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || ((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && blastFlag == 8) && 8656 <= s__state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((blastFlag <= 5 && (((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 8656 <= s__state)) || ((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 8656 <= s__state) && blastFlag == 7)) || 8576 == \old(initial_state)) || \old(initial_state) == 8544) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 6 == blastFlag) && 8656 <= s__state)) || \old(initial_state) == 8512) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || \old(initial_state) == 8592) || ((((((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && blastFlag == 9) && 8656 <= s__state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || ((((blastFlag == 11 && (((((((((((((((((((((!(8560 == \old(initial_state)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(8609 == \old(initial_state))) && !(s__state == 8656)) && !(8576 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(\old(initial_state) == 8512)) && !(\old(initial_state) == 8544)) && !(s__state == 8657)) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && s__hit == 0) && s__state <= 8672) && 8656 <= 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 1 error locations. SAFE Result, 78.3s OverallTime, 43 OverallIterations, 36 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 52.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 9702 SDtfs, 15097 SDslu, 8925 SDs, 0 SdLazy, 6182 SolverSat, 1737 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8015occurred in iteration=35, 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: 4.9s AutomataMinimizationTime, 43 MinimizatonAttempts, 5049 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 801 NumberOfFragments, 11221 HoareAnnotationTreeSize, 32 FomulaSimplifications, 1135419 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 32 FomulaSimplificationsInter, 318927 FormulaSimplificationTreeSizeReductionInter, 44.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 11840 NumberOfCodeBlocks, 11840 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 11795 ConstructedInterpolants, 0 QuantifiedInterpolants, 6828315 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 45 InterpolantComputations, 43 PerfectInterpolantSequences, 61080/61132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...