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_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:04:16,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:04:16,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:04:16,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:04:16,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:04:16,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:04:16,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:04:16,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:04:16,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:04:16,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:04:16,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:04:16,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:04:16,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:04:16,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:04:16,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:04:16,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:04:16,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:04:16,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:04:16,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:04:16,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:04:16,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:04:16,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:04:16,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:04:16,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:04:16,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:04:16,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:04:16,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:04:16,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:04:16,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:04:16,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:04:16,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:04:16,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:04:16,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:04:16,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:04:16,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:04:16,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:04:16,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:04:16,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:04:16,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:04:16,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:04:16,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:04:16,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:04:16,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:04:16,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:04:16,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:04:16,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:04:16,829 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:04:16,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:04:16,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:04:16,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:04:16,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:04:16,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:04:16,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:04:16,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:04:16,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:04:16,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:04:16,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:04:16,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:04:16,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:04:16,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:04:16,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:04:16,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:04:16,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:04:16,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:04:16,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:04:16,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:04:16,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:04:16,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:04:16,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:04:16,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:04:16,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:04:16,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:04:16,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:04:16,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:04:16,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:04:16,909 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:04:16,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-09-07 13:04:16,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0deaec11a/b50752e562704f63a8e9022c493fc4f4/FLAG74bc61cae [2019-09-07 13:04:17,455 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:04:17,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-09-07 13:04:17,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0deaec11a/b50752e562704f63a8e9022c493fc4f4/FLAG74bc61cae [2019-09-07 13:04:17,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0deaec11a/b50752e562704f63a8e9022c493fc4f4 [2019-09-07 13:04:17,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:04:17,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:04:17,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:17,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:04:17,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:04:17,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:17" (1/1) ... [2019-09-07 13:04:17,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc7c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:17, skipping insertion in model container [2019-09-07 13:04:17,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:17" (1/1) ... [2019-09-07 13:04:17,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:04:17,869 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:04:18,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:18,230 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:04:18,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:18,332 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:04:18,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18 WrapperNode [2019-09-07 13:04:18,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:18,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:04:18,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:04:18,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:04:18,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... [2019-09-07 13:04:18,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:04:18,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:04:18,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:04:18,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:04:18,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:04:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:04:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:04:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-07 13:04:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:04:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:04:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:04:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:04:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:04:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:04:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-07 13:04:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:04:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:04:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:04:18,666 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:04:19,184 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-07 13:04:19,184 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-07 13:04:19,187 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:04:19,188 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:04:19,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:19 BoogieIcfgContainer [2019-09-07 13:04:19,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:04:19,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:04:19,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:04:19,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:04:19,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:04:17" (1/3) ... [2019-09-07 13:04:19,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:19, skipping insertion in model container [2019-09-07 13:04:19,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:18" (2/3) ... [2019-09-07 13:04:19,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:19, skipping insertion in model container [2019-09-07 13:04:19,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:19" (3/3) ... [2019-09-07 13:04:19,198 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-09-07 13:04:19,209 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:04:19,218 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:04:19,235 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:04:19,269 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:04:19,269 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:04:19,270 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:04:19,270 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:04:19,270 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:04:19,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:04:19,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:04:19,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:04:19,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:04:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-07 13:04:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 13:04:19,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:19,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:19,319 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-09-07 13:04:19,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:19,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:19,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:19,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:19,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:19,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:19,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:19,640 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-09-07 13:04:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:20,111 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-09-07 13:04:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:20,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-07 13:04:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:20,127 INFO L225 Difference]: With dead ends: 338 [2019-09-07 13:04:20,128 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 13:04:20,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 13:04:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-09-07 13:04:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-07 13:04:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-09-07 13:04:20,230 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-09-07 13:04:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:20,231 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-09-07 13:04:20,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-09-07 13:04:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 13:04:20,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:20,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:20,238 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-09-07 13:04:20,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:20,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:20,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:20,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:20,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:20,393 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-09-07 13:04:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:20,661 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-09-07 13:04:20,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:20,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-07 13:04:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:20,664 INFO L225 Difference]: With dead ends: 356 [2019-09-07 13:04:20,664 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 13:04:20,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 13:04:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-09-07 13:04:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-07 13:04:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-09-07 13:04:20,683 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-09-07 13:04:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:20,683 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-09-07 13:04:20,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-09-07 13:04:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 13:04:20,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:20,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:20,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-09-07 13:04:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:20,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:20,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:20,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:20,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:20,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:20,797 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-09-07 13:04:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:21,062 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-09-07 13:04:21,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:21,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 13:04:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:21,070 INFO L225 Difference]: With dead ends: 417 [2019-09-07 13:04:21,070 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 13:04:21,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 13:04:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-09-07 13:04:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-07 13:04:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-09-07 13:04:21,115 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-09-07 13:04:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:21,116 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-09-07 13:04:21,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-09-07 13:04:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 13:04:21,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:21,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:21,126 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-09-07 13:04:21,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:21,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:21,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:21,231 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-09-07 13:04:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:21,488 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-09-07 13:04:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:21,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-07 13:04:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:21,491 INFO L225 Difference]: With dead ends: 466 [2019-09-07 13:04:21,491 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 13:04:21,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 13:04:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-09-07 13:04:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 13:04:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-09-07 13:04:21,508 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-09-07 13:04:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:21,508 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-09-07 13:04:21,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-09-07 13:04:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:04:21,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:21,511 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:04:21,512 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-09-07 13:04:21,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:21,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:21,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:21,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:21,582 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-09-07 13:04:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:21,784 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-09-07 13:04:21,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:21,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-07 13:04:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:21,787 INFO L225 Difference]: With dead ends: 510 [2019-09-07 13:04:21,787 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 13:04:21,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 13:04:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-09-07 13:04:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-07 13:04:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-09-07 13:04:21,801 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-09-07 13:04:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:21,801 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-09-07 13:04:21,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-09-07 13:04:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 13:04:21,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:21,809 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:21,810 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-09-07 13:04:21,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:21,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:21,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:21,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:21,917 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-09-07 13:04:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:22,136 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-09-07 13:04:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:22,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-07 13:04:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:22,139 INFO L225 Difference]: With dead ends: 535 [2019-09-07 13:04:22,139 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 13:04:22,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 13:04:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-09-07 13:04:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-07 13:04:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-09-07 13:04:22,168 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-09-07 13:04:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:22,169 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-09-07 13:04:22,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-09-07 13:04:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 13:04:22,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:22,171 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:04:22,171 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-09-07 13:04:22,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:22,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:22,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:22,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:22,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:22,270 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-09-07 13:04:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:22,493 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-09-07 13:04:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:22,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-07 13:04:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:22,496 INFO L225 Difference]: With dead ends: 552 [2019-09-07 13:04:22,497 INFO L226 Difference]: Without dead ends: 298 [2019-09-07 13:04:22,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-07 13:04:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-07 13:04:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-07 13:04:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-09-07 13:04:22,512 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-09-07 13:04:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:22,512 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-09-07 13:04:22,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-09-07 13:04:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 13:04:22,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:22,514 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:22,514 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-09-07 13:04:22,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:22,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:22,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:22,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:22,567 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-09-07 13:04:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:22,745 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-09-07 13:04:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:22,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-07 13:04:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:22,748 INFO L225 Difference]: With dead ends: 600 [2019-09-07 13:04:22,748 INFO L226 Difference]: Without dead ends: 315 [2019-09-07 13:04:22,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-07 13:04:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-09-07 13:04:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-07 13:04:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-09-07 13:04:22,764 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-09-07 13:04:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:22,764 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-09-07 13:04:22,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-09-07 13:04:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 13:04:22,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:22,766 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:22,766 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-09-07 13:04:22,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:22,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:22,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:22,828 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-09-07 13:04:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:23,126 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-09-07 13:04:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:23,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-07 13:04:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:23,129 INFO L225 Difference]: With dead ends: 651 [2019-09-07 13:04:23,130 INFO L226 Difference]: Without dead ends: 351 [2019-09-07 13:04:23,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-07 13:04:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-07 13:04:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-07 13:04:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-09-07 13:04:23,148 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-09-07 13:04:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:23,148 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-09-07 13:04:23,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-09-07 13:04:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 13:04:23,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:23,150 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:23,151 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-09-07 13:04:23,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:23,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:23,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:23,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:23,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:23,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:23,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:23,196 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-09-07 13:04:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:23,362 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-09-07 13:04:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:23,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-07 13:04:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:23,366 INFO L225 Difference]: With dead ends: 687 [2019-09-07 13:04:23,366 INFO L226 Difference]: Without dead ends: 351 [2019-09-07 13:04:23,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-07 13:04:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-07 13:04:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-07 13:04:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-09-07 13:04:23,388 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-09-07 13:04:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:23,388 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-09-07 13:04:23,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-09-07 13:04:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 13:04:23,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:23,392 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:23,393 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-09-07 13:04:23,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:23,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:04:23,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:23,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:23,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:23,454 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-09-07 13:04:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:23,664 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-09-07 13:04:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:23,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-07 13:04:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:23,667 INFO L225 Difference]: With dead ends: 687 [2019-09-07 13:04:23,668 INFO L226 Difference]: Without dead ends: 351 [2019-09-07 13:04:23,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-07 13:04:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-07 13:04:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-07 13:04:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-09-07 13:04:23,687 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-09-07 13:04:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:23,687 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-09-07 13:04:23,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-09-07 13:04:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 13:04:23,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:23,690 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:23,691 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-09-07 13:04:23,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 13:04:23,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:23,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:23,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:23,750 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-09-07 13:04:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:23,981 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-09-07 13:04:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:23,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-07 13:04:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:23,984 INFO L225 Difference]: With dead ends: 714 [2019-09-07 13:04:23,985 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 13:04:23,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 13:04:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-09-07 13:04:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-07 13:04:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-09-07 13:04:24,006 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-09-07 13:04:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:24,007 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-09-07 13:04:24,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-09-07 13:04:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 13:04:24,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:24,009 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:24,009 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-09-07 13:04:24,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:24,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:24,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:24,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 13:04:24,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:24,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:24,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:24,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:24,072 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-09-07 13:04:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:24,322 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-09-07 13:04:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:24,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-07 13:04:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:24,324 INFO L225 Difference]: With dead ends: 738 [2019-09-07 13:04:24,325 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 13:04:24,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 13:04:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-09-07 13:04:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-07 13:04:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-09-07 13:04:24,343 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-09-07 13:04:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:24,343 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-09-07 13:04:24,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-09-07 13:04:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 13:04:24,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:24,345 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:24,345 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-09-07 13:04:24,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:24,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:24,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:24,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 13:04:24,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:24,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:24,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:24,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:24,395 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-09-07 13:04:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:24,556 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-09-07 13:04:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:24,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-07 13:04:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:24,559 INFO L225 Difference]: With dead ends: 742 [2019-09-07 13:04:24,559 INFO L226 Difference]: Without dead ends: 382 [2019-09-07 13:04:24,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-07 13:04:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-09-07 13:04:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-07 13:04:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-09-07 13:04:24,581 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-09-07 13:04:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:24,581 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-09-07 13:04:24,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-09-07 13:04:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 13:04:24,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:24,583 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:24,583 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-09-07 13:04:24,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:24,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:24,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:24,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:24,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:24,667 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-09-07 13:04:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:24,861 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-09-07 13:04:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:24,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-07 13:04:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:24,864 INFO L225 Difference]: With dead ends: 782 [2019-09-07 13:04:24,864 INFO L226 Difference]: Without dead ends: 413 [2019-09-07 13:04:24,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-07 13:04:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-09-07 13:04:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-07 13:04:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-09-07 13:04:24,886 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-09-07 13:04:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:24,886 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-09-07 13:04:24,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-09-07 13:04:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 13:04:24,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:24,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:24,888 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-09-07 13:04:24,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:24,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:24,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:24,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:24,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:24,968 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-09-07 13:04:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:25,187 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-09-07 13:04:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:25,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-07 13:04:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:25,190 INFO L225 Difference]: With dead ends: 811 [2019-09-07 13:04:25,190 INFO L226 Difference]: Without dead ends: 413 [2019-09-07 13:04:25,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-07 13:04:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-09-07 13:04:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-07 13:04:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-09-07 13:04:25,209 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-09-07 13:04:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:25,209 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-09-07 13:04:25,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-09-07 13:04:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 13:04:25,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:25,211 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-07 13:04:25,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-09-07 13:04:25,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:25,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 13:04:25,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:25,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:25,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:25,263 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-09-07 13:04:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:25,462 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-09-07 13:04:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:25,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-07 13:04:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:25,465 INFO L225 Difference]: With dead ends: 834 [2019-09-07 13:04:25,465 INFO L226 Difference]: Without dead ends: 436 [2019-09-07 13:04:25,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-07 13:04:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-09-07 13:04:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-07 13:04:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-09-07 13:04:25,486 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-09-07 13:04:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:25,486 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-09-07 13:04:25,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-09-07 13:04:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 13:04:25,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:25,488 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-07 13:04:25,488 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-09-07 13:04:25,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 13:04:25,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:25,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:25,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:25,530 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-09-07 13:04:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:25,727 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-09-07 13:04:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:25,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-07 13:04:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:25,730 INFO L225 Difference]: With dead ends: 855 [2019-09-07 13:04:25,730 INFO L226 Difference]: Without dead ends: 436 [2019-09-07 13:04:25,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-07 13:04:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-09-07 13:04:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-07 13:04:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-09-07 13:04:25,758 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-09-07 13:04:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:25,759 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-09-07 13:04:25,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-09-07 13:04:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 13:04:25,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:25,761 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:25,762 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-09-07 13:04:25,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:25,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:25,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:25,822 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-09-07 13:04:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:26,033 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-09-07 13:04:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:26,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-07 13:04:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:26,037 INFO L225 Difference]: With dead ends: 896 [2019-09-07 13:04:26,037 INFO L226 Difference]: Without dead ends: 477 [2019-09-07 13:04:26,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-07 13:04:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-09-07 13:04:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-09-07 13:04:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-09-07 13:04:26,068 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-09-07 13:04:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:26,068 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-09-07 13:04:26,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-09-07 13:04:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 13:04:26,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:26,070 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:04:26,071 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-09-07 13:04:26,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 13:04:26,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:26,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:26,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:26,143 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-09-07 13:04:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:26,346 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-09-07 13:04:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:26,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-07 13:04:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:26,349 INFO L225 Difference]: With dead ends: 971 [2019-09-07 13:04:26,349 INFO L226 Difference]: Without dead ends: 510 [2019-09-07 13:04:26,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-07 13:04:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-09-07 13:04:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-07 13:04:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-09-07 13:04:26,371 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-09-07 13:04:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:26,372 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-09-07 13:04:26,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-09-07 13:04:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 13:04:26,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:26,374 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:26,374 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-09-07 13:04:26,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:26,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:26,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:04:26,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:26,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:26,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:26,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:26,417 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-09-07 13:04:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:26,634 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-09-07 13:04:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:26,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-07 13:04:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:26,638 INFO L225 Difference]: With dead ends: 1010 [2019-09-07 13:04:26,638 INFO L226 Difference]: Without dead ends: 513 [2019-09-07 13:04:26,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-07 13:04:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-09-07 13:04:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-07 13:04:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-09-07 13:04:26,662 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-09-07 13:04:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:26,662 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-09-07 13:04:26,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-09-07 13:04:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 13:04:26,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:26,664 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:04:26,664 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-09-07 13:04:26,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 13:04:26,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:26,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:26,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:26,708 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-09-07 13:04:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:26,940 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-09-07 13:04:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:26,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-07 13:04:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:26,945 INFO L225 Difference]: With dead ends: 1009 [2019-09-07 13:04:26,945 INFO L226 Difference]: Without dead ends: 512 [2019-09-07 13:04:26,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-07 13:04:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-09-07 13:04:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-07 13:04:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-09-07 13:04:26,969 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-09-07 13:04:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:26,969 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-09-07 13:04:26,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-09-07 13:04:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 13:04:26,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:26,971 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:26,972 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-09-07 13:04:26,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 13:04:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:27,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:27,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,014 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-09-07 13:04:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:27,076 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-09-07 13:04:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:27,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-07 13:04:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:27,082 INFO L225 Difference]: With dead ends: 1497 [2019-09-07 13:04:27,082 INFO L226 Difference]: Without dead ends: 1000 [2019-09-07 13:04:27,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-09-07 13:04:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-09-07 13:04:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-07 13:04:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-09-07 13:04:27,111 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-09-07 13:04:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:27,112 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-09-07 13:04:27,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-09-07 13:04:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 13:04:27,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:27,114 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:27,114 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-09-07 13:04:27,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:27,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 13:04:27,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:27,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:27,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,173 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-09-07 13:04:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:27,257 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-09-07 13:04:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:27,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-07 13:04:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:27,262 INFO L225 Difference]: With dead ends: 1505 [2019-09-07 13:04:27,262 INFO L226 Difference]: Without dead ends: 1007 [2019-09-07 13:04:27,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-07 13:04:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-09-07 13:04:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-09-07 13:04:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-09-07 13:04:27,317 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-09-07 13:04:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:27,318 INFO L475 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-09-07 13:04:27,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-09-07 13:04:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 13:04:27,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:27,322 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:27,322 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-09-07 13:04:27,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-07 13:04:27,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:27,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:27,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,368 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-09-07 13:04:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:27,469 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-09-07 13:04:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:27,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-07 13:04:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:27,477 INFO L225 Difference]: With dead ends: 2499 [2019-09-07 13:04:27,477 INFO L226 Difference]: Without dead ends: 1505 [2019-09-07 13:04:27,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-09-07 13:04:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-09-07 13:04:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-09-07 13:04:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-09-07 13:04:27,558 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-09-07 13:04:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:27,559 INFO L475 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-09-07 13:04:27,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-09-07 13:04:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 13:04:27,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:27,564 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:27,564 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-09-07 13:04:27,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 13:04:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:27,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,620 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-09-07 13:04:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:27,741 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-09-07 13:04:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:27,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-07 13:04:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:27,751 INFO L225 Difference]: With dead ends: 2003 [2019-09-07 13:04:27,751 INFO L226 Difference]: Without dead ends: 2001 [2019-09-07 13:04:27,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-09-07 13:04:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-09-07 13:04:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-09-07 13:04:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-09-07 13:04:27,883 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-09-07 13:04:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:27,884 INFO L475 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-09-07 13:04:27,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-09-07 13:04:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 13:04:27,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:27,888 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 13:04:27,888 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-09-07 13:04:27,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 13:04:27,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:27,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:27,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:27,969 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-09-07 13:04:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:28,241 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-09-07 13:04:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:28,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-09-07 13:04:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:28,251 INFO L225 Difference]: With dead ends: 4173 [2019-09-07 13:04:28,251 INFO L226 Difference]: Without dead ends: 2187 [2019-09-07 13:04:28,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-09-07 13:04:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-09-07 13:04:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-09-07 13:04:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-09-07 13:04:28,352 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-09-07 13:04:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:28,352 INFO L475 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-09-07 13:04:28,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-09-07 13:04:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 13:04:28,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:28,359 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 13:04:28,359 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-09-07 13:04:28,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:28,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 13:04:28,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:04:28,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:28,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:28,442 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-09-07 13:04:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:28,733 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-09-07 13:04:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:28,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-07 13:04:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:28,743 INFO L225 Difference]: With dead ends: 4337 [2019-09-07 13:04:28,743 INFO L226 Difference]: Without dead ends: 2155 [2019-09-07 13:04:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:04:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-09-07 13:04:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-09-07 13:04:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-09-07 13:04:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-09-07 13:04:28,844 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-09-07 13:04:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:28,844 INFO L475 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-09-07 13:04:28,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-09-07 13:04:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 13:04:28,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:28,850 INFO L399 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] [2019-09-07 13:04:28,850 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-09-07 13:04:28,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-07 13:04:28,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:04:28,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:04:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:04:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 13:04:29,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:04:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 13:04:29,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:04:29,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:04:29,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:29,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:29,131 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 5 states. [2019-09-07 13:04:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:30,385 INFO L93 Difference]: Finished difference Result 7470 states and 10982 transitions. [2019-09-07 13:04:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:04:30,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-09-07 13:04:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:30,413 INFO L225 Difference]: With dead ends: 7470 [2019-09-07 13:04:30,413 INFO L226 Difference]: Without dead ends: 5287 [2019-09-07 13:04:30,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 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-09-07 13:04:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2019-09-07 13:04:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 3006. [2019-09-07 13:04:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3006 states. [2019-09-07 13:04:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4356 transitions. [2019-09-07 13:04:30,626 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4356 transitions. Word has length 188 [2019-09-07 13:04:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:30,627 INFO L475 AbstractCegarLoop]: Abstraction has 3006 states and 4356 transitions. [2019-09-07 13:04:30,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4356 transitions. [2019-09-07 13:04:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 13:04:30,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:30,634 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:30,634 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-09-07 13:04:30,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:30,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:30,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:30,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 13:04:30,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:30,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:30,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:30,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:30,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:30,713 INFO L87 Difference]: Start difference. First operand 3006 states and 4356 transitions. Second operand 3 states. [2019-09-07 13:04:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:30,903 INFO L93 Difference]: Finished difference Result 4787 states and 6941 transitions. [2019-09-07 13:04:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:30,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-07 13:04:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:30,937 INFO L225 Difference]: With dead ends: 4787 [2019-09-07 13:04:30,942 INFO L226 Difference]: Without dead ends: 3599 [2019-09-07 13:04:30,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2019-09-07 13:04:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3599. [2019-09-07 13:04:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-07 13:04:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5219 transitions. [2019-09-07 13:04:31,177 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5219 transitions. Word has length 192 [2019-09-07 13:04:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:31,178 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5219 transitions. [2019-09-07 13:04:31,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5219 transitions. [2019-09-07 13:04:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 13:04:31,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:31,188 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:31,188 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-09-07 13:04:31,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:31,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:31,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-07 13:04:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:31,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:31,259 INFO L87 Difference]: Start difference. First operand 3599 states and 5219 transitions. Second operand 3 states. [2019-09-07 13:04:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:31,643 INFO L93 Difference]: Finished difference Result 7219 states and 10458 transitions. [2019-09-07 13:04:31,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:31,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-09-07 13:04:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:31,655 INFO L225 Difference]: With dead ends: 7219 [2019-09-07 13:04:31,656 INFO L226 Difference]: Without dead ends: 3659 [2019-09-07 13:04:31,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2019-09-07 13:04:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3599. [2019-09-07 13:04:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-07 13:04:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5171 transitions. [2019-09-07 13:04:31,842 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5171 transitions. Word has length 270 [2019-09-07 13:04:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:31,843 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5171 transitions. [2019-09-07 13:04:31,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5171 transitions. [2019-09-07 13:04:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-07 13:04:31,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:31,854 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:31,854 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-09-07 13:04:31,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:31,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:31,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 13:04:31,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:31,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:31,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:31,985 INFO L87 Difference]: Start difference. First operand 3599 states and 5171 transitions. Second operand 3 states. [2019-09-07 13:04:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:32,289 INFO L93 Difference]: Finished difference Result 7249 states and 10392 transitions. [2019-09-07 13:04:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:32,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-07 13:04:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:32,299 INFO L225 Difference]: With dead ends: 7249 [2019-09-07 13:04:32,299 INFO L226 Difference]: Without dead ends: 3689 [2019-09-07 13:04:32,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-07 13:04:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3599. [2019-09-07 13:04:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-07 13:04:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4955 transitions. [2019-09-07 13:04:32,516 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4955 transitions. Word has length 274 [2019-09-07 13:04:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:32,517 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 4955 transitions. [2019-09-07 13:04:32,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4955 transitions. [2019-09-07 13:04:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-07 13:04:32,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:32,532 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-07 13:04:32,532 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-09-07 13:04:32,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:32,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:32,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 13:04:32,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:32,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:32,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:32,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:32,638 INFO L87 Difference]: Start difference. First operand 3599 states and 4955 transitions. Second operand 3 states. [2019-09-07 13:04:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:32,962 INFO L93 Difference]: Finished difference Result 7249 states and 9968 transitions. [2019-09-07 13:04:32,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:32,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-09-07 13:04:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:32,971 INFO L225 Difference]: With dead ends: 7249 [2019-09-07 13:04:32,971 INFO L226 Difference]: Without dead ends: 3689 [2019-09-07 13:04:32,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-07 13:04:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3599. [2019-09-07 13:04:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-07 13:04:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4895 transitions. [2019-09-07 13:04:33,195 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4895 transitions. Word has length 284 [2019-09-07 13:04:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:33,196 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 4895 transitions. [2019-09-07 13:04:33,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4895 transitions. [2019-09-07 13:04:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 13:04:33,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:33,207 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-07 13:04:33,207 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1875632044, now seen corresponding path program 1 times [2019-09-07 13:04:33,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-07 13:04:33,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:04:33,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:04:33,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:04:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:04:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:04:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-07 13:04:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:04:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 13:04:33,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:04:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:04:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:04:33,476 INFO L87 Difference]: Start difference. First operand 3599 states and 4895 transitions. Second operand 4 states. [2019-09-07 13:04:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:34,041 INFO L93 Difference]: Finished difference Result 8384 states and 11255 transitions. [2019-09-07 13:04:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:04:34,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-09-07 13:04:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:34,053 INFO L225 Difference]: With dead ends: 8384 [2019-09-07 13:04:34,053 INFO L226 Difference]: Without dead ends: 4794 [2019-09-07 13:04:34,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2019-09-07 13:04:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 3413. [2019-09-07 13:04:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-09-07 13:04:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4595 transitions. [2019-09-07 13:04:34,224 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4595 transitions. Word has length 303 [2019-09-07 13:04:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:34,224 INFO L475 AbstractCegarLoop]: Abstraction has 3413 states and 4595 transitions. [2019-09-07 13:04:34,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:04:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4595 transitions. [2019-09-07 13:04:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 13:04:34,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:34,235 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:34,235 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1215949711, now seen corresponding path program 1 times [2019-09-07 13:04:34,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:34,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 13:04:34,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:34,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:34,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:34,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:34,326 INFO L87 Difference]: Start difference. First operand 3413 states and 4595 transitions. Second operand 3 states. [2019-09-07 13:04:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:34,719 INFO L93 Difference]: Finished difference Result 6995 states and 9420 transitions. [2019-09-07 13:04:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:34,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-07 13:04:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:34,729 INFO L225 Difference]: With dead ends: 6995 [2019-09-07 13:04:34,729 INFO L226 Difference]: Without dead ends: 3513 [2019-09-07 13:04:34,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2019-09-07 13:04:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3503. [2019-09-07 13:04:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-09-07 13:04:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4667 transitions. [2019-09-07 13:04:34,987 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4667 transitions. Word has length 303 [2019-09-07 13:04:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:34,988 INFO L475 AbstractCegarLoop]: Abstraction has 3503 states and 4667 transitions. [2019-09-07 13:04:34,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4667 transitions. [2019-09-07 13:04:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-07 13:04:35,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:35,006 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 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] [2019-09-07 13:04:35,006 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1498035288, now seen corresponding path program 1 times [2019-09-07 13:04:35,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-09-07 13:04:35,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:35,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:35,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:35,204 INFO L87 Difference]: Start difference. First operand 3503 states and 4667 transitions. Second operand 3 states. [2019-09-07 13:04:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:35,594 INFO L93 Difference]: Finished difference Result 7023 states and 9368 transitions. [2019-09-07 13:04:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:35,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-07 13:04:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:35,605 INFO L225 Difference]: With dead ends: 7023 [2019-09-07 13:04:35,605 INFO L226 Difference]: Without dead ends: 3559 [2019-09-07 13:04:35,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-09-07 13:04:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3503. [2019-09-07 13:04:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-09-07 13:04:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4661 transitions. [2019-09-07 13:04:35,808 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4661 transitions. Word has length 304 [2019-09-07 13:04:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:35,809 INFO L475 AbstractCegarLoop]: Abstraction has 3503 states and 4661 transitions. [2019-09-07 13:04:35,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4661 transitions. [2019-09-07 13:04:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-07 13:04:35,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:35,819 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-09-07 13:04:35,819 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:35,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1685249203, now seen corresponding path program 1 times [2019-09-07 13:04:35,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:35,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:35,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:35,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:35,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 687 proven. 16 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-07 13:04:35,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:04:35,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:04:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:36,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:04:36,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:04:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 13:04:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:04:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:04:36,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:36,191 INFO L87 Difference]: Start difference. First operand 3503 states and 4661 transitions. Second operand 5 states. [2019-09-07 13:04:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,034 INFO L93 Difference]: Finished difference Result 11011 states and 14412 transitions. [2019-09-07 13:04:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:04:37,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 315 [2019-09-07 13:04:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,049 INFO L225 Difference]: With dead ends: 11011 [2019-09-07 13:04:37,049 INFO L226 Difference]: Without dead ends: 7547 [2019-09-07 13:04:37,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 319 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-09-07 13:04:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-09-07 13:04:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 4499. [2019-09-07 13:04:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-07 13:04:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5764 transitions. [2019-09-07 13:04:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5764 transitions. Word has length 315 [2019-09-07 13:04:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,317 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 5764 transitions. [2019-09-07 13:04:37,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5764 transitions. [2019-09-07 13:04:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 13:04:37,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,329 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:37,329 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-09-07 13:04:37,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 13:04:37,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,424 INFO L87 Difference]: Start difference. First operand 4499 states and 5764 transitions. Second operand 3 states. [2019-09-07 13:04:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,858 INFO L93 Difference]: Finished difference Result 9044 states and 11563 transitions. [2019-09-07 13:04:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-07 13:04:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,875 INFO L225 Difference]: With dead ends: 9044 [2019-09-07 13:04:37,875 INFO L226 Difference]: Without dead ends: 4584 [2019-09-07 13:04:37,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2019-09-07 13:04:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4499. [2019-09-07 13:04:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-07 13:04:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5674 transitions. [2019-09-07 13:04:38,200 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5674 transitions. Word has length 327 [2019-09-07 13:04:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,200 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 5674 transitions. [2019-09-07 13:04:38,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5674 transitions. [2019-09-07 13:04:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-07 13:04:38,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,213 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:04:38,214 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash -30585770, now seen corresponding path program 1 times [2019-09-07 13:04:38,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 926 proven. 26 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 13:04:38,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:04:38,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:04:38,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:04:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 13:04:38,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:04:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 13:04:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:04:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:04:38,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:04:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:04:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:38,569 INFO L87 Difference]: Start difference. First operand 4499 states and 5674 transitions. Second operand 5 states. [2019-09-07 13:04:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,335 INFO L93 Difference]: Finished difference Result 12069 states and 15181 transitions. [2019-09-07 13:04:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:04:39,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2019-09-07 13:04:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,351 INFO L225 Difference]: With dead ends: 12069 [2019-09-07 13:04:39,351 INFO L226 Difference]: Without dead ends: 7609 [2019-09-07 13:04:39,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:04:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2019-09-07 13:04:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 4559. [2019-09-07 13:04:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4559 states. [2019-09-07 13:04:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 5677 transitions. [2019-09-07 13:04:39,603 INFO L78 Accepts]: Start accepts. Automaton has 4559 states and 5677 transitions. Word has length 370 [2019-09-07 13:04:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,603 INFO L475 AbstractCegarLoop]: Abstraction has 4559 states and 5677 transitions. [2019-09-07 13:04:39,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:04:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4559 states and 5677 transitions. [2019-09-07 13:04:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 13:04:39,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,619 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,619 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-09-07 13:04:39,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:04:39,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,745 INFO L87 Difference]: Start difference. First operand 4559 states and 5677 transitions. Second operand 3 states. [2019-09-07 13:04:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,999 INFO L93 Difference]: Finished difference Result 8511 states and 10608 transitions. [2019-09-07 13:04:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-07 13:04:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,008 INFO L225 Difference]: With dead ends: 8511 [2019-09-07 13:04:40,008 INFO L226 Difference]: Without dead ends: 3870 [2019-09-07 13:04:40,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-09-07 13:04:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3781. [2019-09-07 13:04:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-09-07 13:04:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4673 transitions. [2019-09-07 13:04:40,214 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4673 transitions. Word has length 393 [2019-09-07 13:04:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,215 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 4673 transitions. [2019-09-07 13:04:40,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4673 transitions. [2019-09-07 13:04:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 13:04:40,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,233 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:40,233 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-09-07 13:04:40,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-07 13:04:40,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,460 INFO L87 Difference]: Start difference. First operand 3781 states and 4673 transitions. Second operand 3 states. [2019-09-07 13:04:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,731 INFO L93 Difference]: Finished difference Result 7161 states and 8862 transitions. [2019-09-07 13:04:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-07 13:04:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,738 INFO L225 Difference]: With dead ends: 7161 [2019-09-07 13:04:40,738 INFO L226 Difference]: Without dead ends: 3793 [2019-09-07 13:04:40,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2019-09-07 13:04:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3781. [2019-09-07 13:04:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-09-07 13:04:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4667 transitions. [2019-09-07 13:04:40,931 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4667 transitions. Word has length 393 [2019-09-07 13:04:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,932 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 4667 transitions. [2019-09-07 13:04:40,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4667 transitions. [2019-09-07 13:04:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-07 13:04:40,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,948 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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] [2019-09-07 13:04:40,948 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-09-07 13:04:40,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-09-07 13:04:41,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:04:41,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:04:41,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:04:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:41,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:04:41,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:04:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-09-07 13:04:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:04:41,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 13:04:41,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:04:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:04:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:04:41,428 INFO L87 Difference]: Start difference. First operand 3781 states and 4667 transitions. Second operand 4 states. [2019-09-07 13:04:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:41,652 INFO L93 Difference]: Finished difference Result 5807 states and 7179 transitions. [2019-09-07 13:04:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:04:41,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-09-07 13:04:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:41,653 INFO L225 Difference]: With dead ends: 5807 [2019-09-07 13:04:41,653 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:04:41,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:04:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:04:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:04:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:04:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:04:41,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-09-07 13:04:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:41,663 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:04:41,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:04:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:04:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:04:41,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:04:41,798 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 166 [2019-09-07 13:04:41,917 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 166 [2019-09-07 13:04:42,047 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 165 [2019-09-07 13:04:45,573 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 717 DAG size of output: 455 [2019-09-07 13:04:45,675 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 187 [2019-09-07 13:04:46,098 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 194 [2019-09-07 13:04:48,025 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 718 DAG size of output: 456 [2019-09-07 13:04:48,514 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 178 [2019-09-07 13:04:48,757 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 235 [2019-09-07 13:04:50,109 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2019-09-07 13:04:51,354 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2019-09-07 13:04:52,220 WARN L188 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 72 [2019-09-07 13:05:03,873 WARN L188 SmtUtils]: Spent 11.64 s on a formula simplification. DAG size of input: 343 DAG size of output: 157 [2019-09-07 13:05:05,525 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 177 DAG size of output: 94 [2019-09-07 13:05:06,585 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 152 DAG size of output: 77 [2019-09-07 13:05:08,333 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 171 DAG size of output: 96 [2019-09-07 13:05:09,842 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-09-07 13:05:11,307 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-09-07 13:05:12,969 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 191 DAG size of output: 77 [2019-09-07 13:05:14,489 WARN L188 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 192 DAG size of output: 114 [2019-09-07 13:05:25,364 WARN L188 SmtUtils]: Spent 10.87 s on a formula simplification. DAG size of input: 344 DAG size of output: 136 [2019-09-07 13:05:26,896 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 187 DAG size of output: 80 [2019-09-07 13:05:27,031 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-07 13:05:28,494 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 196 DAG size of output: 121 [2019-09-07 13:05:30,238 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 209 DAG size of output: 84 [2019-09-07 13:05:30,369 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-07 13:05:31,483 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 154 DAG size of output: 88 [2019-09-07 13:05:32,830 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-09-07 13:05:34,288 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-09-07 13:05:35,671 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 168 DAG size of output: 103 [2019-09-07 13:05:37,410 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 233 DAG size of output: 139 [2019-09-07 13:05:37,413 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:05:37,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:37,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:37,413 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:05:37,413 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:05:37,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:05:37,414 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 628 639) the Hoare annotation is: true [2019-09-07 13:05:37,414 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 628 639) no Hoare annotation was computed. [2019-09-07 13:05:37,414 INFO L439 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-09-07 13:05:37,414 INFO L443 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2019-09-07 13:05:37,414 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 628 639) no Hoare annotation was computed. [2019-09-07 13:05:37,414 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 611) no Hoare annotation was computed. [2019-09-07 13:05:37,414 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 562) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 573) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 584) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 595) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 603) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2019-09-07 13:05:37,415 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-09-07 13:05:37,416 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 563) the Hoare annotation is: (let ((.cse3 (= |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|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse12 (= |ssl3_accept_#in~initial_state| 8512)) (.cse8 (= |ssl3_accept_#in~initial_state| 8544)) (.cse5 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse25 (= |ssl3_accept_#in~initial_state| 8481)) (.cse10 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8592)) (.cse7 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse11 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse27 (= |ssl3_accept_#in~initial_state| 8496)) (.cse6 (= |ssl3_accept_#in~initial_state| 8528)) (.cse9 (= |ssl3_accept_#in~initial_state| 8672)) (.cse24 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse13 (and (not .cse3) (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 (= ssl3_accept_~s__state~0 8496)) (not .cse20) (not .cse4) (not (= ssl3_accept_~s__state~0 8545)) (not .cse12) (not (= ssl3_accept_~s__state~0 8480)) (not .cse8) (not .cse5) (not .cse2) (not (= ssl3_accept_~s__state~0 12292)) (not .cse25) (not (= ssl3_accept_~s__state~0 8529)) (not .cse10) (not .cse18) (not (= ssl3_accept_~s__state~0 8640)) (not .cse16) (not (= ssl3_accept_~s__state~0 8561)) (not .cse7) (not .cse1) (not (= ssl3_accept_~s__state~0 8448)) (not .cse11) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8512)) (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 (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse22) (not .cse27) (not .cse6) (not .cse9) (not .cse24) (not (= ssl3_accept_~s__state~0 8592)))) (.cse23 (= |ssl3_accept_#in~initial_state| 8656)) (.cse26 (= 8657 |ssl3_accept_#in~initial_state|))) (let ((.cse15 (= ssl3_accept_~s__hit~0 0)) (.cse14 (<= 8672 ssl3_accept_~s__state~0)) (.cse19 (and .cse13 (not .cse23) (<= ssl3_accept_~blastFlag~0 6) (not (= ssl3_accept_~s__state~0 8656)) (not .cse26) (not (= ssl3_accept_~s__state~0 8657))))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and (and (and .cse13 (<= 6 ssl3_accept_~blastFlag~0)) .cse14) .cse15) .cse16 .cse17 .cse18 (and .cse14 .cse19 (<= ssl3_accept_~blastFlag~0 4)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse15 (and .cse14 .cse19) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)))))) [2019-09-07 13:05:37,416 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 595) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 13:05:37,416 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 503) no Hoare annotation was computed. [2019-09-07 13:05:37,416 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 602) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 561) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 572) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 583) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 594) no Hoare annotation was computed. [2019-09-07 13:05:37,417 INFO L439 ceAbstractionStarter]: At program point L403(lines 394 415) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,418 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-09-07 13:05:37,418 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-09-07 13:05:37,418 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-09-07 13:05:37,418 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 561) 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) (not (= ssl3_accept_~s__state~0 8544)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496)) [2019-09-07 13:05:37,418 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 573) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ssl3_accept_~s__state~0 8593))) (.cse3 (not (= ssl3_accept_~s__state~0 8640))) (.cse4 (not (= ssl3_accept_~s__state~0 8609))) (.cse5 (not (= ssl3_accept_~s__state~0 8592))) (.cse6 (<= 8576 ssl3_accept_~s__state~0))) (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) (and (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |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 (and .cse0 (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5)) (= ssl3_accept_~s__hit~0 0) .cse6) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,419 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 584) the Hoare annotation is: (let ((.cse13 (= |ssl3_accept_#in~initial_state| 8592)) (.cse7 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse9 (= |ssl3_accept_#in~initial_state| 8672)) (.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse14 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse16 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse12 (= |ssl3_accept_#in~initial_state| 8512)) (.cse8 (= |ssl3_accept_#in~initial_state| 8544)) (.cse5 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse23 (= |ssl3_accept_#in~initial_state| 8481)) (.cse10 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse15 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8561)) (.cse17 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse18 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse24 (= |ssl3_accept_#in~initial_state| 8496)) (.cse6 (= |ssl3_accept_#in~initial_state| 8528)) (.cse19 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse20 (and (not .cse13) (not .cse7) (not .cse1) (not .cse9) (and (not .cse3) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse14) (not (= ssl3_accept_~s__state~0 8528)) (not .cse4) (not .cse16) (not (= ssl3_accept_~s__state~0 8545)) (not .cse12) (not (= ssl3_accept_~s__state~0 8480)) (not .cse8) (not .cse5) (not .cse2) (not .cse23) (not (= ssl3_accept_~s__state~0 8529)) (not .cse10) (not .cse15) (not (= ssl3_accept_~s__state~0 8561)) (not .cse11) (not (= ssl3_accept_~s__state~0 8512)) (not .cse17) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not .cse18) (not .cse24) (not .cse6) (not .cse19)))) (.cse21 (<= ssl3_accept_~s__state~0 8576)) (.cse22 (<= 8466 ssl3_accept_~s__state~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ssl3_accept_#in~initial_state| 8656) .cse19 (and (and (= ssl3_accept_~s__hit~0 0) (and .cse20 .cse21 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7))) .cse22) .cse23 (= 8657 |ssl3_accept_#in~initial_state|) .cse24 (and (and .cse20 .cse21 (<= ssl3_accept_~blastFlag~0 2)) .cse22)))) [2019-09-07 13:05:37,419 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 540) no Hoare annotation was computed. [2019-09-07 13:05:37,419 INFO L443 ceAbstractionStarter]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2019-09-07 13:05:37,419 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-09-07 13:05:37,419 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 561) 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) (not (= ssl3_accept_~s__state~0 8544)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496)) [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 571) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 582) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 593) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 515) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,420 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 627) the Hoare annotation is: true [2019-09-07 13:05:37,420 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 570) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 581) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 592) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 514) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-09-07 13:05:37,421 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 411) no Hoare annotation was computed. [2019-09-07 13:05:37,422 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-09-07 13:05:37,422 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 594) 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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |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 (not (= ssl3_accept_~s__state~0 8481)) (<= ssl3_accept_~blastFlag~0 2) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__state~0 8592))) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496)) [2019-09-07 13:05:37,422 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 571) the Hoare annotation is: (let ((.cse6 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse8 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse13 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse10 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse14 (= |ssl3_accept_#in~initial_state| 8561)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse12 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (and (not .cse6) (not .cse0) (not .cse7) (not .cse11) (not .cse8) (not .cse2) (not .cse13) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8672)) (not .cse10) (not .cse1) (not .cse14) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8608)) (not .cse9) (not .cse12))) (.cse5 (<= 8576 ssl3_accept_~s__state~0))) (or .cse0 .cse1 .cse2 (and (and (and (<= ssl3_accept_~blastFlag~0 2) .cse3) .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and (= ssl3_accept_~s__hit~0 0) (and .cse4 (and .cse3 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7))) .cse5) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496)))) [2019-09-07 13:05:37,423 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 582) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8480))) (.cse8 (= ssl3_accept_~s__hit~0 0)) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |ssl3_accept_#in~initial_state| 8656) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 569) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 580) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 591) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-09-07 13:05:37,423 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 552) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 568) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 579) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-09-07 13:05:37,424 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 590) no Hoare annotation was computed. [2019-09-07 13:05:37,425 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2019-09-07 13:05:37,425 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-09-07 13:05:37,425 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 569) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8593))) (.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (not (= ssl3_accept_~s__state~0 8640))) (.cse3 (<= 8576 ssl3_accept_~s__state~0)) (.cse4 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (= |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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse0 (= ssl3_accept_~s__hit~0 0) .cse1 .cse2 .cse3 .cse4) (= 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| 8496))) [2019-09-07 13:05:37,425 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 580) 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 8544))) (.cse3 (not (= ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ssl3_accept_~s__state~0 8480))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (= ssl3_accept_~s__hit~0 0)) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8513))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |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 (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,425 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L446 ceAbstractionStarter]: At program point L615(lines 98 616) the Hoare annotation is: true [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 567) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 578) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 589) no Hoare annotation was computed. [2019-09-07 13:05:37,426 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 590) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 13:05:37,427 INFO L439 ceAbstractionStarter]: At program point L485(lines 72 626) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point L452(lines 452 461) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,427 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 627) no Hoare annotation was computed. [2019-09-07 13:05:37,428 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 8544))) (.cse3 (not (= ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ssl3_accept_~s__state~0 8480))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (= ssl3_accept_~s__hit~0 0)) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8513))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |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 (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,428 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 566) no Hoare annotation was computed. [2019-09-07 13:05:37,428 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 577) no Hoare annotation was computed. [2019-09-07 13:05:37,428 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 588) no Hoare annotation was computed. [2019-09-07 13:05:37,428 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-09-07 13:05:37,428 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 626) no Hoare annotation was computed. [2019-09-07 13:05:37,429 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 489) no Hoare annotation was computed. [2019-09-07 13:05:37,429 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 567) the Hoare annotation is: (let ((.cse2 (= ssl3_accept_~s__hit~0 0)) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (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) (and (and (<= ssl3_accept_~blastFlag~0 2) .cse0) .cse1) (and (and .cse2 (and (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0)) .cse0)) .cse1) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (and .cse1 (and .cse2 .cse0 .cse3 .cse4)) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (and .cse0 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 .cse3 .cse4) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:05:37,429 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 578) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,429 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 588) the Hoare annotation is: (let ((.cse8 (= ssl3_accept_~s__hit~0 0)) (.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ssl3_accept_~s__state~0 8512))) (.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)) (.cse14 (<= 8466 ssl3_accept_~s__state~0))) (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 .cse13 .cse14) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |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 .cse14 (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 622) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 524) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 627) no Hoare annotation was computed. [2019-09-07 13:05:37,430 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 565) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 576) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 587) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 494) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L443 ceAbstractionStarter]: For program point L490-2(lines 490 494) no Hoare annotation was computed. [2019-09-07 13:05:37,431 INFO L439 ceAbstractionStarter]: At program point L391(lines 382 417) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 564) no Hoare annotation was computed. [2019-09-07 13:05:37,432 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 575) no Hoare annotation was computed. [2019-09-07 13:05:37,433 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 586) no Hoare annotation was computed. [2019-09-07 13:05:37,433 INFO L439 ceAbstractionStarter]: At program point L559(lines 99 614) the Hoare annotation is: (let ((.cse5 (not (= ssl3_accept_~s__state~0 8481))) (.cse6 (<= ssl3_accept_~blastFlag~0 2)) (.cse30 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse23 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse7 (not (= ssl3_accept_~s__state~0 8529))) (.cse51 (= |ssl3_accept_#in~initial_state| 8592)) (.cse48 (= |ssl3_accept_#in~initial_state| 8656)) (.cse8 (not (= ssl3_accept_~s__state~0 8561))) (.cse28 (= |ssl3_accept_#in~initial_state| 8561)) (.cse9 (not (= ssl3_accept_~s__state~0 8544))) (.cse34 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse50 (= 8657 |ssl3_accept_#in~initial_state|)) (.cse39 (= |ssl3_accept_#in~initial_state| 8641)) (.cse10 (not (= ssl3_accept_~s__state~0 8528))) (.cse47 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse40 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse11 (not (= ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ssl3_accept_~s__state~0 8480))) (.cse24 (= |ssl3_accept_#in~initial_state| 8544)) (.cse38 (= |ssl3_accept_#in~initial_state| 8529)) (.cse49 (= |ssl3_accept_#in~initial_state| 8481)) (.cse46 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse42 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse13 (not (= ssl3_accept_~s__state~0 8512))) (.cse14 (not (= ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ssl3_accept_~s__state~0 8513))) (.cse16 (not (= ssl3_accept_~s__state~0 8497))) (.cse17 (<= ssl3_accept_~s__state~0 8576)) (.cse41 (= |ssl3_accept_#in~initial_state| 8528)) (.cse43 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse22 (<= ssl3_accept_~s__state~0 3)) (.cse31 (<= 8672 ssl3_accept_~s__state~0)) (.cse18 (<= 8466 ssl3_accept_~s__state~0)) (.cse35 (not (= ssl3_accept_~s__state~0 8641))) (.cse36 (not (= ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8640 ssl3_accept_~s__state~0)) (.cse33 (<= ssl3_accept_~s__state~0 8672)) (.cse29 (and .cse5 .cse6 (not .cse30) (not .cse23) .cse7 (not .cse51) (not .cse48) .cse8 (not (= ssl3_accept_~s__state~0 8448)) (not .cse28) .cse9 (not .cse34) (not .cse50) (not .cse39) .cse10 (not (= ssl3_accept_~s__state~0 8496)) (not .cse47) (not .cse40) .cse11 .cse12 (not .cse24) (not .cse38) (not .cse49) (not .cse46) (not .cse42) .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse41) (not .cse43))) (.cse37 (<= ssl3_accept_~blastFlag~0 7)) (.cse32 (<= 6 ssl3_accept_~blastFlag~0)) (.cse25 (not (= ssl3_accept_~s__state~0 8593))) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ssl3_accept_~s__state~0 8609))) (.cse27 (<= 8576 ssl3_accept_~s__state~0)) (.cse1 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse19 (<= 8448 ssl3_accept_~s__state~0)) (.cse44 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse45 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse20 (<= ssl3_accept_~s__state~0 8448)) (.cse21 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse19 .cse20 .cse21) (and .cse22 .cse21 .cse4) .cse23 .cse24 (and .cse6 .cse25 .cse0 .cse26 .cse27) .cse28 (and .cse29 .cse22) .cse30 (and .cse31 .cse32 .cse21 .cse33) .cse34 (and .cse35 .cse21 .cse36 .cse2 .cse3 .cse4 .cse33) (and .cse31 .cse21 .cse4 .cse33) (and .cse1 .cse22 .cse3 .cse4) (and .cse37 .cse32 .cse22 .cse21) (and .cse31 .cse3 .cse33) .cse38 .cse39 .cse40 .cse41 .cse42 (and (and .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse21 .cse15 .cse16 .cse17) .cse18) .cse43 (and .cse37 .cse32 .cse19 .cse44 .cse45 .cse20 .cse21) .cse46 (and .cse5 .cse37 .cse32 .cse7 .cse8 .cse11 .cse12 .cse21 .cse15 .cse16 .cse17 .cse18) .cse47 .cse48 .cse49 .cse50 (and .cse6 .cse35 .cse36 .cse2 .cse33) .cse51 (and .cse37 .cse32 .cse35 .cse21 .cse36 .cse2 .cse33) (and .cse29 .cse19) (and .cse37 .cse32 .cse25 .cse21 .cse0 .cse26 .cse27) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse1 .cse19 .cse20 .cse3 .cse4) (= |ssl3_accept_#in~initial_state| 8512) (and .cse6 .cse19 .cse44 .cse45 .cse20 .cse21) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|)))) [2019-09-07 13:05:37,433 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-09-07 13:05:37,433 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-09-07 13:05:37,434 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 565) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__hit~0 0)) (.cse1 (not (= ssl3_accept_~s__state~0 8640))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8641))) (.cse4 (<= ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8640 ssl3_accept_~s__state~0))) (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 (and .cse0 (and (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3) (<= 6 ssl3_accept_~blastFlag~0)) .cse4)) .cse5) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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 (and (and .cse1 .cse2 .cse3) .cse0 .cse4 (<= ssl3_accept_~blastFlag~0 4) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) .cse5) (= |ssl3_accept_#in~initial_state| 8481) (and (and (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3) .cse4) .cse5) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-09-07 13:05:37,434 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 576) the Hoare annotation is: (let ((.cse11 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse8 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672)) (.cse7 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse12 (= |ssl3_accept_#in~initial_state| 8544)) (.cse9 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse6 (= |ssl3_accept_#in~initial_state| 8529)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse10 (= |ssl3_accept_#in~initial_state| 8528))) (let ((.cse2 (= ssl3_accept_~s__hit~0 0)) (.cse3 (<= 8544 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (and (not (= ssl3_accept_~s__state~0 8672)) (not .cse11) (not (= ssl3_accept_~s__state~0 8593)) (not .cse1) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse8) (not .cse13) (and (not .cse7) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse12) (not .cse9) (not .cse6) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8529)) (not .cse14) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8512)) (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 8513)) (not .cse10)) (not (= ssl3_accept_~s__state~0 8592))))) (or .cse0 .cse1 (and .cse2 (and .cse3 (and .cse4 .cse5 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse2 (and .cse3 (and .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 2)))) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496)))) [2019-09-07 13:05:37,434 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-09-07 13:05:37,434 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 563) no Hoare annotation was computed. [2019-09-07 13:05:37,434 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 574) no Hoare annotation was computed. [2019-09-07 13:05:37,435 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 585) no Hoare annotation was computed. [2019-09-07 13:05:37,435 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 614) the Hoare annotation is: (let ((.cse8 (<= ssl3_accept_~s__state~0 3)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse23 (<= ssl3_accept_~s__state~0 8576)) (.cse24 (<= 8466 ssl3_accept_~s__state~0)) (.cse2 (<= 8640 ssl3_accept_~s__state~0)) (.cse11 (<= ssl3_accept_~s__state~0 8672)) (.cse14 (<= ssl3_accept_~blastFlag~0 7)) (.cse10 (<= 6 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse15 (not (= ssl3_accept_~s__state~0 8481))) (.cse17 (not (= ssl3_accept_~s__state~0 8529))) (.cse18 (not (= ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ssl3_accept_~s__state~0 8641))) (.cse27 (not (= ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ssl3_accept_~s__state~0 8480))) (.cse13 (not (= ssl3_accept_~s__state~0 8657))) (.cse28 (not (= ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ssl3_accept_~s__state~0 8513))) (.cse22 (not (= ssl3_accept_~s__state~0 8497))) (.cse1 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= 8448 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse16 (<= ssl3_accept_~blastFlag~0 2)) (.cse25 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse26 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (<= ssl3_accept_~s__state~0 8448)) (.cse7 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse6 .cse7) (and .cse8 .cse7 .cse4) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (= 8560 |ssl3_accept_#in~initial_state|) (and .cse9 .cse10 .cse7 .cse11) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse12 .cse7 .cse13 .cse2 .cse3 .cse4 .cse11) (and .cse9 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse3 .cse4) (and .cse14 .cse10 .cse8 .cse7) (and .cse9 .cse3 .cse11) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (and (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse7 .cse21 .cse22 .cse23) .cse24) (= |ssl3_accept_#in~initial_state| 8672) (and .cse14 .cse10 .cse5 .cse25 .cse26 .cse6 .cse7) (= 8640 |ssl3_accept_#in~initial_state|) (and .cse15 .cse14 .cse10 .cse17 .cse18 .cse19 .cse20 .cse7 .cse21 .cse22 .cse23 .cse24) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (and .cse14 .cse10 .cse12 .cse7 .cse13 .cse2 .cse11) (and .cse14 .cse10 .cse27 .cse7 .cse0 .cse28 (<= 8576 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse15 .cse16 .cse17 .cse18 (not (= ssl3_accept_~s__state~0 8448)) .cse12 (not (= ssl3_accept_~s__state~0 8544)) .cse27 (not (= ssl3_accept_~s__state~0 8528)) .cse19 .cse20 .cse13 (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8512)) .cse28 (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8560)) .cse21 .cse22) (and .cse1 .cse5 .cse6 .cse3 .cse4) (= |ssl3_accept_#in~initial_state| 8512) (and .cse16 .cse25 .cse26 .cse6 .cse7) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|))) [2019-09-07 13:05:37,435 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 531) no Hoare annotation was computed. [2019-09-07 13:05:37,435 INFO L443 ceAbstractionStarter]: For program point L529-2(lines 208 558) no Hoare annotation was computed. [2019-09-07 13:05:37,435 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-09-07 13:05:37,436 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 574) the Hoare annotation is: (let ((.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ssl3_accept_~s__state~0 8448)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (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) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 (<= ssl3_accept_~blastFlag~0 4) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse0 .cse3 .cse4 .cse1 .cse2) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse3 .cse4 .cse1 .cse2) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 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| 8496))) [2019-09-07 13:05:37,436 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 587) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.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 8560))) (.cse12 (not (= ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ssl3_accept_~s__state~0 8497))) (.cse14 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (<= 8448 ssl3_accept_~s__state~0))) (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) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (and .cse1 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ssl3_accept_~s__hit~0 0) .cse10 .cse11 .cse12 .cse13 .cse14)) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse0) (= |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| 8496))) [2019-09-07 13:05:37,436 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 13:05:37,436 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 612) no Hoare annotation was computed. [2019-09-07 13:05:37,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:05:37 BoogieIcfgContainer [2019-09-07 13:05:37,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:05:37,499 INFO L168 Benchmark]: Toolchain (without parser) took 79694.95 ms. Allocated memory was 132.6 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 86.9 MB in the beginning and 387.6 MB in the end (delta: -300.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-07 13:05:37,500 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 132.6 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 13:05:37,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.25 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 86.5 MB in the beginning and 172.4 MB in the end (delta: -85.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:37,501 INFO L168 Benchmark]: Boogie Preprocessor took 57.88 ms. Allocated memory is still 200.3 MB. Free memory was 172.4 MB in the beginning and 169.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:37,502 INFO L168 Benchmark]: RCFGBuilder took 797.86 ms. Allocated memory is still 200.3 MB. Free memory was 169.6 MB in the beginning and 118.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:37,503 INFO L168 Benchmark]: TraceAbstraction took 78307.63 ms. Allocated memory was 200.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 118.6 MB in the beginning and 387.6 MB in the end (delta: -269.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-07 13:05:37,505 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.49 ms. Allocated memory is still 132.6 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 527.25 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 86.5 MB in the beginning and 172.4 MB in the end (delta: -85.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.88 ms. Allocated memory is still 200.3 MB. Free memory was 172.4 MB in the beginning and 169.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.86 ms. Allocated memory is still 200.3 MB. Free memory was 169.6 MB in the beginning and 118.6 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78307.63 ms. Allocated memory was 200.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 118.6 MB in the beginning and 387.6 MB in the end (delta: -269.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (((((blastFlag <= 2 && !(s__state == 8593)) && s__state <= 8640) && !(s__state == 8640)) && 8576 <= s__state) && !(s__state == 8592))) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8640)) && 8576 <= s__state) && !(s__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) == 8496 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || ((s__state <= 3 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640)) || 8513 == \old(initial_state)) || \old(initial_state) == 8544) || ((((blastFlag <= 2 && !(s__state == 8593)) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8561) || ((((((((((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(8609 == \old(initial_state))) && !(8657 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && s__state <= 3)) || 8560 == \old(initial_state)) || (((8672 <= s__state && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672)) || 8609 == \old(initial_state)) || ((((((!(s__state == 8641) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8672 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8640 <= s__s3__tmp__next_state___0 && s__state <= 3) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 3) && s__hit == 0)) || ((8672 <= s__state && blastFlag <= 4) && s__state <= 8672)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || (((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || ((((blastFlag <= 2 && !(s__state == 8641)) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || \old(initial_state) == 8592) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8641)) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || ((((((((((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(8609 == \old(initial_state))) && !(8657 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 8448 <= s__state)) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || (((((blastFlag <= 2 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state) - InvariantResult [Line: 126]: 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) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (8448 <= s__state && (((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(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 == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((blastFlag <= 2 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || (((((((((((((((!(s__state == 8481) && !(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 == 8560)) && !(s__state == 8513)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (8466 <= s__state && ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(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 == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496) || ((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state)) || ((s__hit == 0 && (blastFlag <= 7 && 6 <= blastFlag) && s__state <= 8640) && 8640 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || (8640 <= s__state && ((s__hit == 0 && s__state <= 8640) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || ((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \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)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((s__hit == 0 && ((((((!(\old(initial_state) == 8592) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8672)) && ((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8561)) && !(\old(initial_state) == 8561)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8513)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(8545 == \old(initial_state))) && s__state <= 8576) && 6 <= blastFlag) && blastFlag <= 7) && 8466 <= s__state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (((((((!(\old(initial_state) == 8592) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8672)) && ((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8561)) && !(\old(initial_state) == 8561)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8513)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(8545 == \old(initial_state))) && s__state <= 8576) && blastFlag <= 2) && 8466 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || ((s__state <= 3 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640)) || 8513 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || 8560 == \old(initial_state)) || (((8672 <= s__state && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672)) || 8609 == \old(initial_state)) || ((((((!(s__state == 8641) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8672 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8640 <= s__s3__tmp__next_state___0 && s__state <= 3) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 3) && s__hit == 0)) || ((8672 <= s__state && blastFlag <= 4) && s__state <= 8672)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || (((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8592) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8641)) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || ((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497))) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((s__state <= 8640 && ((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8592)) && 8576 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((s__state <= 8640 && (((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8592)) && s__hit == 0) && 8576 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || !(s__state == 8544)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (s__hit == 0 && 8544 <= s__state && ((s__state <= 8576 && (((((((((!(s__state == 8672) && !(8673 == \old(initial_state))) && !(s__state == 8593)) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(s__state == 8496)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8672)) && ((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8641)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(s__state == 8592)) && 6 <= blastFlag) && blastFlag <= 7)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || (s__hit == 0 && 8544 <= s__state && (s__state <= 8576 && (((((((((!(s__state == 8672) && !(8673 == \old(initial_state))) && !(s__state == 8593)) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(s__state == 8496)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8672)) && ((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8641)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(s__state == 8592)) && blastFlag <= 2)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 192]: 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__hit == 0 && ((((blastFlag <= 7 && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8641)) && 6 <= blastFlag) && s__state <= 8672) && 8640 <= s__state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (((((((!(s__state == 8640) && !(s__state == 8672)) && !(s__state == 8641)) && s__hit == 0) && s__state <= 8672) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state)) || \old(initial_state) == 8481) || (((((blastFlag <= 2 && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8641)) && s__state <= 8672) && 8640 <= s__state)) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || !(s__state == 8544)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8656) || ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(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 == 8560)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || (((blastFlag <= 2 && (((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8672)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8608)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && s__state <= 8640) && 8576 <= s__state)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((s__hit == 0 && s__state <= 8640 && (((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8672)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8608)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 6 <= blastFlag) && blastFlag <= 7) && 8576 <= s__state)) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 105]: 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) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 8496 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 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) == 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) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || ((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(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)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 6 <= blastFlag) && 8672 <= s__state) && s__hit == 0)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((8672 <= s__state && (((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(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)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && !(\old(initial_state) == 8656)) && blastFlag <= 6) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(s__state == 8657)) && blastFlag <= 4)) || 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) == 8496) || ((s__hit == 0 && 8672 <= s__state && (((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(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)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && !(\old(initial_state) == 8656)) && blastFlag <= 6) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8640) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 1 error locations. SAFE Result, 78.1s OverallTime, 42 OverallIterations, 14 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 55.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 8305 SDtfs, 12723 SDslu, 8304 SDs, 0 SdLazy, 6859 SolverSat, 1550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1691 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4559occurred in iteration=39, 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: 3.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 10895 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 261 NumberOfFragments, 5442 HoareAnnotationTreeSize, 32 FomulaSimplifications, 1925681 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 806728 FormulaSimplificationTreeSizeReductionInter, 48.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 8523 NumberOfCodeBlocks, 8523 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8476 ConstructedInterpolants, 0 QuantifiedInterpolants, 2910697 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2937 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 47 InterpolantComputations, 40 PerfectInterpolantSequences, 21019/21183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...