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_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:16:57,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:16:57,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:16:57,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:16:57,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:16:57,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:16:57,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:16:57,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:16:57,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:16:57,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:16:57,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:16:57,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:16:57,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:16:57,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:16:57,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:16:57,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:16:57,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:16:57,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:16:57,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:16:57,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:16:57,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:16:57,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:16:57,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:16:57,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:16:57,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:16:57,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:16:57,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:16:57,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:16:57,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:16:57,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:16:57,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:16:57,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:16:57,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:16:57,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:16:57,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:16:57,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:16:57,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:16:57,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:16:57,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:16:57,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:16:57,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:16:57,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 16:16:57,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:16:57,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:16:57,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:16:57,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:16:57,714 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:16:57,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:16:57,716 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:16:57,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:16:57,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:16:57,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:16:57,719 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:16:57,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:16:57,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:16:57,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:16:57,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:16:57,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:16:57,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:16:57,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:16:57,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:16:57,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:16:57,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:16:57,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:16:57,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:16:57,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:16:57,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:16:57,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:16:57,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:16:57,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:16:57,782 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:16:57,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-02 16:16:57,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1988801/c9be5e5b979d4867bfe01630cfb2180b/FLAGa00c32db0 [2019-10-02 16:16:58,340 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:16:58,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-02 16:16:58,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1988801/c9be5e5b979d4867bfe01630cfb2180b/FLAGa00c32db0 [2019-10-02 16:16:58,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1988801/c9be5e5b979d4867bfe01630cfb2180b [2019-10-02 16:16:58,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:16:58,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:16:58,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:16:58,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:16:58,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:16:58,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:16:58" (1/1) ... [2019-10-02 16:16:58,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c3b94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:58, skipping insertion in model container [2019-10-02 16:16:58,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:16:58" (1/1) ... [2019-10-02 16:16:58,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:16:58,758 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:16:59,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:16:59,192 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:16:59,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:16:59,274 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:16:59,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59 WrapperNode [2019-10-02 16:16:59,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:16:59,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:16:59,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:16:59,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:16:59,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... [2019-10-02 16:16:59,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:16:59,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:16:59,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:16:59,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:16:59,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:16:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:16:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:16:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-02 16:16:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:16:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:16:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:16:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:16:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:16:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:16:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-02 16:16:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:16:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:16:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:16:59,631 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:17:00,128 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-02 16:17:00,129 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-02 16:17:00,131 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:17:00,132 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:17:00,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:00 BoogieIcfgContainer [2019-10-02 16:17:00,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:17:00,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:17:00,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:17:00,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:17:00,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:16:58" (1/3) ... [2019-10-02 16:17:00,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9686be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:00, skipping insertion in model container [2019-10-02 16:17:00,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:16:59" (2/3) ... [2019-10-02 16:17:00,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9686be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:00, skipping insertion in model container [2019-10-02 16:17:00,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:00" (3/3) ... [2019-10-02 16:17:00,142 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-10-02 16:17:00,152 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:17:00,159 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:17:00,177 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:17:00,207 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:17:00,207 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:17:00,207 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:17:00,208 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:17:00,208 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:17:00,208 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:17:00,208 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:17:00,208 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:17:00,208 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:17:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-02 16:17:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 16:17:00,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:00,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:00,239 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-02 16:17:00,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:00,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:00,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:00,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:00,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:00,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:00,581 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-02 16:17:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:01,061 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-02 16:17:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:01,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-02 16:17:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:01,078 INFO L225 Difference]: With dead ends: 337 [2019-10-02 16:17:01,078 INFO L226 Difference]: Without dead ends: 180 [2019-10-02 16:17:01,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-02 16:17:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-02 16:17:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-02 16:17:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-02 16:17:01,145 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-02 16:17:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:01,147 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-02 16:17:01,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-02 16:17:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 16:17:01,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:01,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:01,152 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-02 16:17:01,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:01,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:01,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:01,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:01,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:01,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:01,308 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-02 16:17:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:01,645 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-02 16:17:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:01,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-02 16:17:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:01,649 INFO L225 Difference]: With dead ends: 385 [2019-10-02 16:17:01,650 INFO L226 Difference]: Without dead ends: 221 [2019-10-02 16:17:01,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-02 16:17:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-02 16:17:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-02 16:17:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-02 16:17:01,690 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-02 16:17:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:01,690 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-02 16:17:01,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-02 16:17:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:17:01,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:01,702 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:01,702 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:01,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-10-02 16:17:01,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:01,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:01,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:01,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:01,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:01,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:01,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:01,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:01,827 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-02 16:17:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:02,075 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-02 16:17:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:02,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:17:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:02,078 INFO L225 Difference]: With dead ends: 450 [2019-10-02 16:17:02,078 INFO L226 Difference]: Without dead ends: 247 [2019-10-02 16:17:02,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-02 16:17:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-02 16:17:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-02 16:17:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-02 16:17:02,099 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-02 16:17:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:02,100 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-02 16:17:02,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-02 16:17:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 16:17:02,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:02,103 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:02,104 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-10-02 16:17:02,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:02,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:02,186 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-02 16:17:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:02,394 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-02 16:17:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:02,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-02 16:17:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:02,397 INFO L225 Difference]: With dead ends: 498 [2019-10-02 16:17:02,397 INFO L226 Difference]: Without dead ends: 264 [2019-10-02 16:17:02,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-02 16:17:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-02 16:17:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-02 16:17:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-02 16:17:02,419 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-02 16:17:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:02,420 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-02 16:17:02,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-02 16:17:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 16:17:02,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:02,425 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:02,425 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-10-02 16:17:02,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:02,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:02,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:02,561 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-02 16:17:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:02,795 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-02 16:17:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:02,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-02 16:17:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:02,798 INFO L225 Difference]: With dead ends: 557 [2019-10-02 16:17:02,798 INFO L226 Difference]: Without dead ends: 308 [2019-10-02 16:17:02,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-02 16:17:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-02 16:17:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-02 16:17:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-02 16:17:02,816 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-02 16:17:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:02,816 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-02 16:17:02,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-02 16:17:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 16:17:02,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:02,819 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:02,819 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-10-02 16:17:02,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:02,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:02,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:02,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:02,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:02,916 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-02 16:17:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:03,105 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-02 16:17:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:03,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-02 16:17:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:03,107 INFO L225 Difference]: With dead ends: 597 [2019-10-02 16:17:03,108 INFO L226 Difference]: Without dead ends: 306 [2019-10-02 16:17:03,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-02 16:17:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-02 16:17:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-02 16:17:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-02 16:17:03,123 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-02 16:17:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:03,123 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-02 16:17:03,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-02 16:17:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 16:17:03,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:03,125 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:03,125 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-10-02 16:17:03,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:03,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:03,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:03,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:03,196 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-02 16:17:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:03,439 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-02 16:17:03,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:03,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-02 16:17:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:03,442 INFO L225 Difference]: With dead ends: 599 [2019-10-02 16:17:03,442 INFO L226 Difference]: Without dead ends: 306 [2019-10-02 16:17:03,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-02 16:17:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-02 16:17:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-02 16:17:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-02 16:17:03,456 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-02 16:17:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:03,456 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-02 16:17:03,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-02 16:17:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 16:17:03,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:03,458 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:03,459 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-10-02 16:17:03,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:03,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 16:17:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:03,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:03,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:03,526 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-02 16:17:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:03,702 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-02 16:17:03,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:03,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-02 16:17:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:03,704 INFO L225 Difference]: With dead ends: 600 [2019-10-02 16:17:03,704 INFO L226 Difference]: Without dead ends: 311 [2019-10-02 16:17:03,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-02 16:17:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-02 16:17:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-02 16:17:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-02 16:17:03,720 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-02 16:17:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:03,720 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-02 16:17:03,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-02 16:17:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 16:17:03,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:03,722 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:03,722 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-10-02 16:17:03,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:03,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:03,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:03,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:03,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:03,807 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-02 16:17:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:03,998 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-02 16:17:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:03,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-02 16:17:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:04,001 INFO L225 Difference]: With dead ends: 640 [2019-10-02 16:17:04,001 INFO L226 Difference]: Without dead ends: 342 [2019-10-02 16:17:04,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-02 16:17:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-02 16:17:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-02 16:17:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-02 16:17:04,017 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-02 16:17:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:04,018 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-02 16:17:04,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-02 16:17:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 16:17:04,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:04,020 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:04,020 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-10-02 16:17:04,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:04,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:04,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:04,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:04,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:04,073 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-02 16:17:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:04,261 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-02 16:17:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:04,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 16:17:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:04,264 INFO L225 Difference]: With dead ends: 669 [2019-10-02 16:17:04,264 INFO L226 Difference]: Without dead ends: 342 [2019-10-02 16:17:04,266 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-02 16:17:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-02 16:17:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-02 16:17:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-02 16:17:04,281 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-02 16:17:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:04,282 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-02 16:17:04,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-02 16:17:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:17:04,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:04,284 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:04,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:04,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-10-02 16:17:04,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:04,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:04,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:04,355 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-02 16:17:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:04,676 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-02 16:17:04,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:04,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:17:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:04,680 INFO L225 Difference]: With dead ends: 702 [2019-10-02 16:17:04,680 INFO L226 Difference]: Without dead ends: 375 [2019-10-02 16:17:04,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-02 16:17:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-02 16:17:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-02 16:17:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-02 16:17:04,708 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-02 16:17:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:04,708 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-02 16:17:04,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-02 16:17:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 16:17:04,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:04,712 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:04,712 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-10-02 16:17:04,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:04,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:04,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 16:17:04,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:04,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:04,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:04,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:04,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:04,792 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-02 16:17:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:05,079 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-02 16:17:05,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:05,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-02 16:17:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:05,083 INFO L225 Difference]: With dead ends: 729 [2019-10-02 16:17:05,083 INFO L226 Difference]: Without dead ends: 375 [2019-10-02 16:17:05,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-02 16:17:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-02 16:17:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-02 16:17:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-02 16:17:05,104 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-02 16:17:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:05,104 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-02 16:17:05,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-02 16:17:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 16:17:05,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:05,107 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:05,107 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-10-02 16:17:05,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 16:17:05,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:05,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:05,176 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-02 16:17:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:05,368 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2019-10-02 16:17:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:05,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-02 16:17:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:05,372 INFO L225 Difference]: With dead ends: 747 [2019-10-02 16:17:05,372 INFO L226 Difference]: Without dead ends: 393 [2019-10-02 16:17:05,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-02 16:17:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-02 16:17:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-02 16:17:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-02 16:17:05,392 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-02 16:17:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:05,392 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-02 16:17:05,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-02 16:17:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 16:17:05,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:05,394 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:05,394 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-10-02 16:17:05,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:05,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 16:17:05,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:05,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:05,447 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-02 16:17:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:05,657 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2019-10-02 16:17:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:05,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-02 16:17:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:05,660 INFO L225 Difference]: With dead ends: 768 [2019-10-02 16:17:05,660 INFO L226 Difference]: Without dead ends: 393 [2019-10-02 16:17:05,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-02 16:17:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-02 16:17:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-02 16:17:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-02 16:17:05,679 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-02 16:17:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:05,680 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-02 16:17:05,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-02 16:17:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 16:17:05,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:05,682 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:05,682 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:05,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:05,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-10-02 16:17:05,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 16:17:05,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:05,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:05,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:05,731 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-02 16:17:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:05,780 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-02 16:17:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:05,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-02 16:17:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:05,785 INFO L225 Difference]: With dead ends: 763 [2019-10-02 16:17:05,785 INFO L226 Difference]: Without dead ends: 761 [2019-10-02 16:17:05,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-02 16:17:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-02 16:17:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-02 16:17:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-02 16:17:05,821 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-02 16:17:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:05,821 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-02 16:17:05,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-02 16:17:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 16:17:05,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:05,824 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:05,824 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-10-02 16:17:05,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:05,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:05,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:05,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 16:17:05,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:05,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:05,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:05,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:05,862 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-02 16:17:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:05,926 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2019-10-02 16:17:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:05,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-02 16:17:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:05,932 INFO L225 Difference]: With dead ends: 1877 [2019-10-02 16:17:05,932 INFO L226 Difference]: Without dead ends: 1129 [2019-10-02 16:17:05,934 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-02 16:17:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-02 16:17:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-02 16:17:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-10-02 16:17:05,984 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-10-02 16:17:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:05,984 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-10-02 16:17:05,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-10-02 16:17:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 16:17:05,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:05,987 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:05,988 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-10-02 16:17:05,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:05,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 16:17:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:06,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:06,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,024 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-10-02 16:17:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:06,104 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2019-10-02 16:17:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:06,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-02 16:17:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:06,112 INFO L225 Difference]: With dead ends: 2596 [2019-10-02 16:17:06,112 INFO L226 Difference]: Without dead ends: 1480 [2019-10-02 16:17:06,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-02 16:17:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-10-02 16:17:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-02 16:17:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-10-02 16:17:06,187 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-10-02 16:17:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:06,188 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-10-02 16:17:06,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-10-02 16:17:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 16:17:06,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:06,193 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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-10-02 16:17:06,194 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-10-02 16:17:06,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:06,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:06,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 16:17:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:06,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,269 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-10-02 16:17:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:06,489 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2019-10-02 16:17:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:06,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-02 16:17:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:06,497 INFO L225 Difference]: With dead ends: 2987 [2019-10-02 16:17:06,497 INFO L226 Difference]: Without dead ends: 1520 [2019-10-02 16:17:06,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-02 16:17:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-10-02 16:17:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-02 16:17:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-10-02 16:17:06,563 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-10-02 16:17:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:06,564 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-10-02 16:17:06,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-10-02 16:17:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 16:17:06,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:06,569 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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-10-02 16:17:06,569 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-10-02 16:17:06,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:06,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:06,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:06,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 16:17:06,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:06,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:06,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,621 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-10-02 16:17:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:06,834 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2019-10-02 16:17:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:06,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-02 16:17:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:06,843 INFO L225 Difference]: With dead ends: 3143 [2019-10-02 16:17:06,844 INFO L226 Difference]: Without dead ends: 1676 [2019-10-02 16:17:06,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-02 16:17:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-10-02 16:17:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-02 16:17:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-10-02 16:17:06,923 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-10-02 16:17:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:06,923 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-10-02 16:17:06,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-10-02 16:17:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 16:17:06,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:06,930 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:06,930 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-10-02 16:17:06,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 16:17:07,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:07,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:07,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:07,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,015 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-10-02 16:17:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:07,238 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2019-10-02 16:17:07,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:07,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 16:17:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:07,248 INFO L225 Difference]: With dead ends: 3195 [2019-10-02 16:17:07,248 INFO L226 Difference]: Without dead ends: 1648 [2019-10-02 16:17:07,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-10-02 16:17:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-10-02 16:17:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-02 16:17:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-10-02 16:17:07,332 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-10-02 16:17:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:07,332 INFO L475 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-10-02 16:17:07,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-10-02 16:17:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 16:17:07,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:07,339 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:07,339 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-10-02 16:17:07,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:07,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:07,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:07,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-02 16:17:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:07,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,404 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-10-02 16:17:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:07,579 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2019-10-02 16:17:07,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:07,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 16:17:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:07,587 INFO L225 Difference]: With dead ends: 3198 [2019-10-02 16:17:07,588 INFO L226 Difference]: Without dead ends: 1651 [2019-10-02 16:17:07,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-10-02 16:17:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-10-02 16:17:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-10-02 16:17:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-10-02 16:17:07,670 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-10-02 16:17:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:07,670 INFO L475 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-10-02 16:17:07,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-10-02 16:17:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 16:17:07,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:07,677 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 16:17:07,678 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-10-02 16:17:07,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:07,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-02 16:17:07,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:07,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:07,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:07,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,796 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-10-02 16:17:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:07,969 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2019-10-02 16:17:07,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:07,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-02 16:17:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:07,978 INFO L225 Difference]: With dead ends: 3403 [2019-10-02 16:17:07,979 INFO L226 Difference]: Without dead ends: 1787 [2019-10-02 16:17:07,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-10-02 16:17:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-10-02 16:17:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-02 16:17:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-10-02 16:17:08,048 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-10-02 16:17:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:08,048 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-10-02 16:17:08,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-10-02 16:17:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 16:17:08,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:08,054 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:08,054 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-10-02 16:17:08,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:08,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:08,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 16:17:08,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:08,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:08,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:08,116 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-10-02 16:17:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:08,328 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2019-10-02 16:17:08,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:08,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-02 16:17:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:08,337 INFO L225 Difference]: With dead ends: 3531 [2019-10-02 16:17:08,337 INFO L226 Difference]: Without dead ends: 1815 [2019-10-02 16:17:08,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-10-02 16:17:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-10-02 16:17:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-02 16:17:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-10-02 16:17:08,405 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-10-02 16:17:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:08,406 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-10-02 16:17:08,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-10-02 16:17:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 16:17:08,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:08,412 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:08,412 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-10-02 16:17:08,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:08,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:08,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-02 16:17:08,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:08,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:08,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:08,513 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-10-02 16:17:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:08,761 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2019-10-02 16:17:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:08,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-02 16:17:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:08,773 INFO L225 Difference]: With dead ends: 3647 [2019-10-02 16:17:08,774 INFO L226 Difference]: Without dead ends: 1831 [2019-10-02 16:17:08,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-10-02 16:17:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-10-02 16:17:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-02 16:17:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-10-02 16:17:08,879 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-10-02 16:17:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:08,879 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-10-02 16:17:08,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-10-02 16:17:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 16:17:08,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:08,889 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 16:17:08,889 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-10-02 16:17:08,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-02 16:17:09,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:09,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:09,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:09,009 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-10-02 16:17:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:09,264 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2019-10-02 16:17:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:09,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-02 16:17:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:09,274 INFO L225 Difference]: With dead ends: 3595 [2019-10-02 16:17:09,275 INFO L226 Difference]: Without dead ends: 1823 [2019-10-02 16:17:09,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-02 16:17:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-10-02 16:17:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-02 16:17:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-10-02 16:17:09,391 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-10-02 16:17:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:09,391 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-10-02 16:17:09,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-10-02 16:17:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 16:17:09,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:09,402 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:09,403 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-10-02 16:17:09,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:09,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:09,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 16:17:09,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:17:09,615 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:17:09,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:09,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:17:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:17:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-02 16:17:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:17:10,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:17:10,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:10,037 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 5 states. [2019-10-02 16:17:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:10,936 INFO L93 Difference]: Finished difference Result 6505 states and 8812 transitions. [2019-10-02 16:17:10,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:17:10,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-10-02 16:17:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:10,979 INFO L225 Difference]: With dead ends: 6505 [2019-10-02 16:17:10,985 INFO L226 Difference]: Without dead ends: 4733 [2019-10-02 16:17:10,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:17:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4733 states. [2019-10-02 16:17:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4733 to 2606. [2019-10-02 16:17:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2606 states. [2019-10-02 16:17:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3471 transitions. [2019-10-02 16:17:11,173 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3471 transitions. Word has length 251 [2019-10-02 16:17:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:11,173 INFO L475 AbstractCegarLoop]: Abstraction has 2606 states and 3471 transitions. [2019-10-02 16:17:11,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3471 transitions. [2019-10-02 16:17:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 16:17:11,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:11,182 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-10-02 16:17:11,182 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-10-02 16:17:11,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:11,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:11,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 16:17:11,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:11,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:11,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:11,329 INFO L87 Difference]: Start difference. First operand 2606 states and 3471 transitions. Second operand 3 states. [2019-10-02 16:17:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:11,514 INFO L93 Difference]: Finished difference Result 7620 states and 10176 transitions. [2019-10-02 16:17:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:11,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-02 16:17:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:11,525 INFO L225 Difference]: With dead ends: 7620 [2019-10-02 16:17:11,526 INFO L226 Difference]: Without dead ends: 5033 [2019-10-02 16:17:11,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2019-10-02 16:17:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5031. [2019-10-02 16:17:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5031 states. [2019-10-02 16:17:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 6716 transitions. [2019-10-02 16:17:11,743 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 6716 transitions. Word has length 258 [2019-10-02 16:17:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:11,743 INFO L475 AbstractCegarLoop]: Abstraction has 5031 states and 6716 transitions. [2019-10-02 16:17:11,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 6716 transitions. [2019-10-02 16:17:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 16:17:11,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:11,754 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:11,754 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-10-02 16:17:11,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:11,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:11,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 16:17:11,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:11,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:11,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:11,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:11,868 INFO L87 Difference]: Start difference. First operand 5031 states and 6716 transitions. Second operand 3 states. [2019-10-02 16:17:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:12,278 INFO L93 Difference]: Finished difference Result 10169 states and 13568 transitions. [2019-10-02 16:17:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:12,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-02 16:17:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:12,292 INFO L225 Difference]: With dead ends: 10169 [2019-10-02 16:17:12,292 INFO L226 Difference]: Without dead ends: 5157 [2019-10-02 16:17:12,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2019-10-02 16:17:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 5032. [2019-10-02 16:17:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2019-10-02 16:17:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 6622 transitions. [2019-10-02 16:17:12,489 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 6622 transitions. Word has length 261 [2019-10-02 16:17:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:12,490 INFO L475 AbstractCegarLoop]: Abstraction has 5032 states and 6622 transitions. [2019-10-02 16:17:12,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 6622 transitions. [2019-10-02 16:17:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 16:17:12,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:12,501 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 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, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:12,502 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-10-02 16:17:12,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 16:17:12,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:17:12,594 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:17:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:12,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:17:12,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:17:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-02 16:17:12,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:17:12,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:17:12,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:12,858 INFO L87 Difference]: Start difference. First operand 5032 states and 6622 transitions. Second operand 5 states. [2019-10-02 16:17:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:13,867 INFO L93 Difference]: Finished difference Result 11310 states and 14757 transitions. [2019-10-02 16:17:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:17:13,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2019-10-02 16:17:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:13,884 INFO L225 Difference]: With dead ends: 11310 [2019-10-02 16:17:13,884 INFO L226 Difference]: Without dead ends: 6232 [2019-10-02 16:17:13,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:17:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2019-10-02 16:17:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 3976. [2019-10-02 16:17:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-10-02 16:17:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5106 transitions. [2019-10-02 16:17:14,180 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5106 transitions. Word has length 287 [2019-10-02 16:17:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:14,181 INFO L475 AbstractCegarLoop]: Abstraction has 3976 states and 5106 transitions. [2019-10-02 16:17:14,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5106 transitions. [2019-10-02 16:17:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 16:17:14,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:14,200 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:14,201 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -304675475, now seen corresponding path program 1 times [2019-10-02 16:17:14,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:14,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:14,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:14,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 644 proven. 26 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 16:17:14,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:17:14,366 INFO L224 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-10-02 16:17:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:14,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:17:14,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:17:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-02 16:17:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:17:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:17:14,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:14,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:14,623 INFO L87 Difference]: Start difference. First operand 3976 states and 5106 transitions. Second operand 5 states. [2019-10-02 16:17:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:15,636 INFO L93 Difference]: Finished difference Result 10967 states and 14161 transitions. [2019-10-02 16:17:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 16:17:15,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2019-10-02 16:17:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:15,653 INFO L225 Difference]: With dead ends: 10967 [2019-10-02 16:17:15,654 INFO L226 Difference]: Without dead ends: 7036 [2019-10-02 16:17:15,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 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-10-02 16:17:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2019-10-02 16:17:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 4706. [2019-10-02 16:17:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4706 states. [2019-10-02 16:17:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4706 states to 4706 states and 5960 transitions. [2019-10-02 16:17:15,961 INFO L78 Accepts]: Start accepts. Automaton has 4706 states and 5960 transitions. Word has length 304 [2019-10-02 16:17:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:15,962 INFO L475 AbstractCegarLoop]: Abstraction has 4706 states and 5960 transitions. [2019-10-02 16:17:15,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4706 states and 5960 transitions. [2019-10-02 16:17:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 16:17:15,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:15,976 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:15,976 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-10-02 16:17:15,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:15,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:15,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:15,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-02 16:17:16,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:16,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:16,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:16,085 INFO L87 Difference]: Start difference. First operand 4706 states and 5960 transitions. Second operand 3 states. [2019-10-02 16:17:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:16,325 INFO L93 Difference]: Finished difference Result 8037 states and 10117 transitions. [2019-10-02 16:17:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:16,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-02 16:17:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:16,331 INFO L225 Difference]: With dead ends: 8037 [2019-10-02 16:17:16,331 INFO L226 Difference]: Without dead ends: 2568 [2019-10-02 16:17:16,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-10-02 16:17:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2019-10-02 16:17:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-02 16:17:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3235 transitions. [2019-10-02 16:17:16,429 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3235 transitions. Word has length 326 [2019-10-02 16:17:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:16,429 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3235 transitions. [2019-10-02 16:17:16,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3235 transitions. [2019-10-02 16:17:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 16:17:16,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:16,439 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:16,440 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-10-02 16:17:16,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:16,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-02 16:17:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:16,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:16,562 INFO L87 Difference]: Start difference. First operand 2568 states and 3235 transitions. Second operand 3 states. [2019-10-02 16:17:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:16,749 INFO L93 Difference]: Finished difference Result 5101 states and 6413 transitions. [2019-10-02 16:17:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:16,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-02 16:17:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:16,755 INFO L225 Difference]: With dead ends: 5101 [2019-10-02 16:17:16,755 INFO L226 Difference]: Without dead ends: 2578 [2019-10-02 16:17:16,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-10-02 16:17:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2568. [2019-10-02 16:17:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-02 16:17:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3210 transitions. [2019-10-02 16:17:16,850 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3210 transitions. Word has length 365 [2019-10-02 16:17:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:16,851 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3210 transitions. [2019-10-02 16:17:16,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3210 transitions. [2019-10-02 16:17:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 16:17:16,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:16,862 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 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, 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] [2019-10-02 16:17:16,862 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-10-02 16:17:16,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:16,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-02 16:17:17,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:17:17,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:17:17,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:17,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:17:17,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:17:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-02 16:17:17,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:17:17,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:17:17,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:17,360 INFO L87 Difference]: Start difference. First operand 2568 states and 3210 transitions. Second operand 5 states. [2019-10-02 16:17:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:18,103 INFO L93 Difference]: Finished difference Result 6690 states and 8355 transitions. [2019-10-02 16:17:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:17:18,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 398 [2019-10-02 16:17:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:18,111 INFO L225 Difference]: With dead ends: 6690 [2019-10-02 16:17:18,111 INFO L226 Difference]: Without dead ends: 4113 [2019-10-02 16:17:18,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:17:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2019-10-02 16:17:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 2638. [2019-10-02 16:17:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-10-02 16:17:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3294 transitions. [2019-10-02 16:17:18,214 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3294 transitions. Word has length 398 [2019-10-02 16:17:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:18,214 INFO L475 AbstractCegarLoop]: Abstraction has 2638 states and 3294 transitions. [2019-10-02 16:17:18,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3294 transitions. [2019-10-02 16:17:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-02 16:17:18,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:18,224 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:18,224 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2019-10-02 16:17:18,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:18,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-10-02 16:17:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:18,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:18,593 INFO L87 Difference]: Start difference. First operand 2638 states and 3294 transitions. Second operand 3 states. [2019-10-02 16:17:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:18,847 INFO L93 Difference]: Finished difference Result 5411 states and 6741 transitions. [2019-10-02 16:17:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:18,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2019-10-02 16:17:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:18,854 INFO L225 Difference]: With dead ends: 5411 [2019-10-02 16:17:18,854 INFO L226 Difference]: Without dead ends: 2818 [2019-10-02 16:17:18,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-10-02 16:17:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2808. [2019-10-02 16:17:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-10-02 16:17:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 3489 transitions. [2019-10-02 16:17:18,958 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 3489 transitions. Word has length 600 [2019-10-02 16:17:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:18,958 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 3489 transitions. [2019-10-02 16:17:18,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3489 transitions. [2019-10-02 16:17:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-10-02 16:17:18,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:18,971 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:18,971 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:18,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2019-10-02 16:17:18,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:18,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-10-02 16:17:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:17:19,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:17:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:17:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:19,348 INFO L87 Difference]: Start difference. First operand 2808 states and 3489 transitions. Second operand 3 states. [2019-10-02 16:17:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:19,612 INFO L93 Difference]: Finished difference Result 5568 states and 6903 transitions. [2019-10-02 16:17:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:17:19,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-10-02 16:17:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:19,618 INFO L225 Difference]: With dead ends: 5568 [2019-10-02 16:17:19,619 INFO L226 Difference]: Without dead ends: 2805 [2019-10-02 16:17:19,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:17:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-10-02 16:17:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2803. [2019-10-02 16:17:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2019-10-02 16:17:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3454 transitions. [2019-10-02 16:17:19,722 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3454 transitions. Word has length 662 [2019-10-02 16:17:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:19,722 INFO L475 AbstractCegarLoop]: Abstraction has 2803 states and 3454 transitions. [2019-10-02 16:17:19,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:17:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3454 transitions. [2019-10-02 16:17:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-10-02 16:17:19,733 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:19,734 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:19,734 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-10-02 16:17:19,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:19,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:19,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-02 16:17:20,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:17:20,139 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:17:20,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:17:20,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:17:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-02 16:17:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:17:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 16:17:20,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:17:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:17:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:17:20,595 INFO L87 Difference]: Start difference. First operand 2803 states and 3454 transitions. Second operand 4 states. [2019-10-02 16:17:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:20,851 INFO L93 Difference]: Finished difference Result 4462 states and 5493 transitions. [2019-10-02 16:17:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:17:20,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2019-10-02 16:17:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:20,853 INFO L225 Difference]: With dead ends: 4462 [2019-10-02 16:17:20,853 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:17:20,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 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-10-02 16:17:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:17:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:17:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:17:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:17:20,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2019-10-02 16:17:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:20,865 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:17:20,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:17:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:17:20,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:17:20,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:17:21,011 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2019-10-02 16:17:21,515 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-10-02 16:17:21,699 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2019-10-02 16:17:23,133 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 476 DAG size of output: 268 [2019-10-02 16:17:24,007 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 477 DAG size of output: 273 [2019-10-02 16:17:25,286 WARN L191 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-10-02 16:17:26,002 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2019-10-02 16:17:27,036 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2019-10-02 16:17:27,879 WARN L191 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-10-02 16:17:28,693 WARN L191 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2019-10-02 16:17:29,162 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-10-02 16:17:30,011 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-10-02 16:17:30,949 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2019-10-02 16:17:37,552 WARN L191 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 217 DAG size of output: 141 [2019-10-02 16:17:38,292 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2019-10-02 16:17:44,509 WARN L191 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 220 DAG size of output: 140 [2019-10-02 16:17:45,045 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2019-10-02 16:17:45,961 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-10-02 16:17:46,838 WARN L191 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 54 [2019-10-02 16:17:47,595 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-10-02 16:17:47,708 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-10-02 16:17:48,508 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2019-10-02 16:17:49,339 WARN L191 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-10-02 16:17:50,224 WARN L191 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-10-02 16:17:51,176 WARN L191 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 63 [2019-10-02 16:17:52,113 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 55 [2019-10-02 16:17:52,120 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:17:52,120 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:17:52,120 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:17:52,120 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:17:52,120 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:17:52,120 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:17:52,120 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 612 623) the Hoare annotation is: true [2019-10-02 16:17:52,120 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 612 623) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L439 ceAbstractionStarter]: At program point L619(line 619) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L619-1(line 619) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 612 623) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2019-10-02 16:17:52,121 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 436) no Hoare annotation was computed. [2019-10-02 16:17:52,122 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 372) no Hoare annotation was computed. [2019-10-02 16:17:52,122 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse4 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ssl3_accept_~s__state~0 8656))) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (and .cse4 .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse4 .cse0 .cse1 .cse2 (not (= ssl3_accept_~s__hit~0 0)) .cse3) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (and .cse0 .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-10-02 16:17:52,122 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,122 INFO L446 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2019-10-02 16:17:52,123 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-10-02 16:17:52,123 INFO L439 ceAbstractionStarter]: At program point L401(lines 392 410) the Hoare annotation is: (let ((.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (and (= 0 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3)) (and (<= ssl3_accept_~blastFlag~0 2) .cse1 (= ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse0) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,123 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2019-10-02 16:17:52,123 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2019-10-02 16:17:52,123 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2019-10-02 16:17:52,123 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2019-10-02 16:17:52,124 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 371) no Hoare annotation was computed. [2019-10-02 16:17:52,124 INFO L443 ceAbstractionStarter]: For program point L337-1(lines 337 371) no Hoare annotation was computed. [2019-10-02 16:17:52,124 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (not (= ssl3_accept_~s__state~0 8672)) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,124 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 557) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (= 1 ssl3_accept_~blastFlag~0) .cse1) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__hit~0 0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,125 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse13 (= |ssl3_accept_#in~initial_state| 8481)) (.cse2 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse10 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse8 (= |ssl3_accept_#in~initial_state| 8656)) (.cse16 (= |ssl3_accept_#in~initial_state| 8561)) (.cse6 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse15 (= |ssl3_accept_#in~initial_state| 8496)) (.cse12 (= |ssl3_accept_#in~initial_state| 8672)) (.cse14 (= 8657 |ssl3_accept_#in~initial_state|)) (.cse9 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse3 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (<= 8466 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse1) (not .cse7) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse11) (not .cse13) (not .cse2) (not .cse10) (not .cse8) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not .cse16) (not .cse6) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not .cse15) (not .cse12) (not (= ssl3_accept_~s__state~0 8656)) (not .cse14) (not .cse9)))) (or .cse0 .cse1 .cse2 (and .cse3 (= ssl3_accept_~s__hit~0 0) (and .cse4 (<= ssl3_accept_~blastFlag~0 2)) .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse3 .cse5 (and (= 1 ssl3_accept_~blastFlag~0) .cse4))))) [2019-10-02 16:17:52,125 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 472) no Hoare annotation was computed. [2019-10-02 16:17:52,125 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-10-02 16:17:52,125 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 368) no Hoare annotation was computed. [2019-10-02 16:17:52,125 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (not (= ssl3_accept_~s__state~0 8672)) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,125 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2019-10-02 16:17:52,125 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2019-10-02 16:17:52,126 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 611) the Hoare annotation is: true [2019-10-02 16:17:52,126 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L308-2(lines 308 315) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L343(lines 343 366) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-10-02 16:17:52,127 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8496)) (= 0 ssl3_accept_~blastFlag~0) (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 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__state~0 8656))) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,127 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 555) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (= 1 ssl3_accept_~blastFlag~0) .cse1) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__hit~0 0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,128 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 566) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8545))) (.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8560))) (.cse5 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse5 (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (= ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse4 .cse5) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,128 INFO L439 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse37 (= |ssl3_accept_#in~initial_state| 8672)) (.cse28 (= |ssl3_accept_#in~initial_state| 8496)) (.cse20 (= |ssl3_accept_#in~initial_state| 8561)) (.cse36 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse32 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse21 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse29 (= |ssl3_accept_#in~initial_state| 8480)) (.cse39 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse38 (= 12292 |ssl3_accept_#in~initial_state|))) (let ((.cse43 (= |ssl3_accept_#in~initial_state| 8481)) (.cse41 (= |ssl3_accept_#in~initial_state| 8656)) (.cse15 (= 1 ssl3_accept_~blastFlag~0)) (.cse44 (= 8657 |ssl3_accept_#in~initial_state|)) (.cse42 (= 8545 |ssl3_accept_#in~initial_state|)) (.cse0 (= ssl3_accept_~s__hit~0 0)) (.cse26 (= 0 ssl3_accept_~blastFlag~0)) (.cse49 (not .cse38)) (.cse52 (not .cse39)) (.cse45 (not .cse29)) (.cse5 (<= ssl3_accept_~blastFlag~0 2)) (.cse46 (not .cse21)) (.cse47 (not .cse32)) (.cse33 (<= ssl3_accept_~s__state~0 8640)) (.cse48 (not .cse11)) (.cse50 (not .cse36)) (.cse51 (not .cse20)) (.cse53 (not .cse28)) (.cse54 (not .cse37)) (.cse55 (<= 8576 ssl3_accept_~s__state~0))) (let ((.cse6 (<= ssl3_accept_~s__state~0 3)) (.cse19 (<= 8466 ssl3_accept_~s__state~0)) (.cse24 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_accept_~s__state~0 8448)) (.cse2 (= 8608 ssl3_accept_~s__state~0)) (.cse12 (not (= ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ssl3_accept_~s__state~0 8480))) (.cse16 (not (= ssl3_accept_~s__state~0 8561))) (.cse7 (<= 8448 ssl3_accept_~s__state~0)) (.cse17 (not (= ssl3_accept_~s__state~0 8497))) (.cse18 (<= ssl3_accept_~s__state~0 8576)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse8 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (and .cse45 .cse5 .cse46 .cse47 .cse33 .cse48 .cse50 .cse51 .cse53 .cse54 .cse55)) (.cse27 (= 8592 ssl3_accept_~s__state~0)) (.cse35 (and .cse45 .cse46 .cse26 .cse47 .cse33 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55)) (.cse25 (<= ssl3_accept_~blastFlag~0 3)) (.cse30 (not (= ssl3_accept_~s__state~0 8657))) (.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse40 (not (= ssl3_accept_~s__state~0 8656))) (.cse31 (<= ssl3_accept_~s__state~0 8672)) (.cse23 (<= 8656 ssl3_accept_~s__state~0)) (.cse9 (not .cse0)) (.cse4 (and .cse45 .cse46 .cse47 .cse33 .cse48 (not .cse43) .cse49 .cse50 (not .cse41) .cse15 .cse51 .cse52 .cse53 .cse54 (not .cse44) .cse55 (not .cse42))) (.cse34 (<= 8640 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse5 .cse6) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse5 .cse0 (= 8512 ssl3_accept_~s__state~0)) (and .cse6 .cse8) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 (and .cse5 .cse0 (= 8528 ssl3_accept_~s__state~0)) .cse21 (and .cse12 .cse5 .cse13 .cse14 .cse0 .cse16 .cse3 .cse17 .cse18 .cse19) (and .cse5 .cse22 .cse3 .cse23) (and .cse15 .cse7 .cse3 .cse24 .cse10) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse25 .cse7 .cse10) (and .cse26 .cse7 .cse3 .cse24 .cse10) (and .cse0 .cse27 .cse1 .cse3) .cse28 (and .cse5 .cse22 .cse9 .cse23) .cse29 (and .cse26 .cse30 .cse31 .cse23) (and .cse27 .cse4) .cse32 (and (and .cse33 .cse8 .cse9) .cse34) (and .cse5 .cse0 .cse7 .cse3 .cse24 .cse10) (and .cse35 .cse2) (and .cse12 (not (= ssl3_accept_~s__state~0 8496)) .cse26 .cse13 .cse14 .cse16 (not (= ssl3_accept_~s__state~0 8448)) .cse7 .cse17 .cse18) (and .cse25 .cse22 .cse8 .cse9 .cse23) .cse36 .cse37 (and .cse5 .cse0 (= ssl3_accept_~s__state~0 8560)) (and .cse1 .cse34 .cse3) (and .cse27 .cse35) (and .cse30 .cse15 .cse31 .cse23) .cse38 .cse39 (and .cse25 .cse30 .cse40 .cse9 .cse31 .cse23) (and .cse35 .cse34) .cse41 .cse42 (and .cse25 .cse30 .cse3 .cse40 .cse31 .cse23) (and (= ssl3_accept_~s__state~0 8544) .cse5 .cse0) (and .cse5 .cse33 .cse34 .cse9) .cse43 .cse44 (and .cse4 .cse34))))) [2019-10-02 16:17:52,128 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 446) no Hoare annotation was computed. [2019-10-02 16:17:52,128 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-10-02 16:17:52,128 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2019-10-02 16:17:52,128 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L346-2(lines 346 350) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 412) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 456) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2019-10-02 16:17:52,129 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:17:52,130 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2019-10-02 16:17:52,130 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2019-10-02 16:17:52,130 INFO L439 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,130 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= 8608 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__hit~0 0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 0 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__state~0 8640) (<= 8576 ssl3_accept_~s__state~0)) (= |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) (and (= 1 ssl3_accept_~blastFlag~0) .cse0) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,130 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8545))) (.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8560))) (.cse5 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse5 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,130 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2019-10-02 16:17:52,131 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point L451(lines 451 453) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 574) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-10-02 16:17:52,132 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 611) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 362) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2019-10-02 16:17:52,133 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-10-02 16:17:52,134 INFO L443 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2019-10-02 16:17:52,134 INFO L439 ceAbstractionStarter]: At program point L355(lines 331 373) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8545))) (.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8560))) (.cse5 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse5 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,134 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__state~0 8640)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (and (and (= 0 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__state~0 8656))) .cse0) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse1 .cse2 .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse2 .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3) (and .cse2 .cse0 (= 1 ssl3_accept_~blastFlag~0)) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |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) (and .cse1 .cse2 .cse0 .cse3) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,134 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (and (= 0 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3)) (and (<= ssl3_accept_~blastFlag~0 2) .cse1 (= ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse0) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,135 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 572) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (not (= ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ssl3_accept_~s__state~0 8497))) (.cse9 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,135 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-02 16:17:52,135 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 424) no Hoare annotation was computed. [2019-10-02 16:17:52,135 INFO L439 ceAbstractionStarter]: At program point L389(lines 380 412) the Hoare annotation is: (let ((.cse1 (<= 8512 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3)) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse0 (and (= 0 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3)) (and (<= ssl3_accept_~blastFlag~0 2) .cse1 (= ssl3_accept_~s__hit~0 0) .cse2 .cse3 .cse0) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,135 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-02 16:17:52,135 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 208 542) no Hoare annotation was computed. [2019-10-02 16:17:52,135 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 611) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L325-2(lines 208 542) no Hoare annotation was computed. [2019-10-02 16:17:52,136 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 410) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 399) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2019-10-02 16:17:52,137 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 3) .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse2 .cse3) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and .cse1 (= 1 ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (= 0 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,138 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse3 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ssl3_accept_~s__state~0 8544))) (.cse1 (not (= ssl3_accept_~s__state~0 8545))) (.cse2 (<= 8512 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and (and .cse0 (= 0 ssl3_accept_~blastFlag~0) .cse1 .cse2) .cse3) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |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) (and .cse3 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2)) (= 8657 |ssl3_accept_#in~initial_state|) (and .cse3 (and (= 1 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2)) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2019-10-02 16:17:52,138 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2019-10-02 16:17:52,139 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse35 (= |ssl3_accept_#in~initial_state| 8672)) (.cse28 (= |ssl3_accept_#in~initial_state| 8496)) (.cse20 (= |ssl3_accept_#in~initial_state| 8561)) (.cse34 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse30 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse21 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse29 (= |ssl3_accept_#in~initial_state| 8480))) (let ((.cse42 (= |ssl3_accept_#in~initial_state| 8481)) (.cse37 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse40 (= |ssl3_accept_#in~initial_state| 8656)) (.cse15 (= 1 ssl3_accept_~blastFlag~0)) (.cse38 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse43 (= 8657 |ssl3_accept_#in~initial_state|)) (.cse41 (= 8545 |ssl3_accept_#in~initial_state|)) (.cse0 (= ssl3_accept_~s__hit~0 0)) (.cse44 (not .cse29)) (.cse5 (<= ssl3_accept_~blastFlag~0 2)) (.cse45 (not .cse21)) (.cse46 (not .cse30)) (.cse31 (<= ssl3_accept_~s__state~0 8640)) (.cse47 (not .cse11)) (.cse48 (not .cse34)) (.cse49 (not .cse20)) (.cse50 (not .cse28)) (.cse51 (not .cse35)) (.cse52 (<= 8576 ssl3_accept_~s__state~0))) (let ((.cse2 (= 8608 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 3)) (.cse18 (<= ssl3_accept_~s__state~0 8576)) (.cse19 (<= 8466 ssl3_accept_~s__state~0)) (.cse27 (= 8592 ssl3_accept_~s__state~0)) (.cse12 (not (= ssl3_accept_~s__state~0 8481))) (.cse26 (= 0 ssl3_accept_~blastFlag~0)) (.cse13 (not (= ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ssl3_accept_~s__state~0 8480))) (.cse16 (not (= ssl3_accept_~s__state~0 8561))) (.cse17 (not (= ssl3_accept_~s__state~0 8497))) (.cse7 (<= 8448 ssl3_accept_~s__state~0)) (.cse24 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_accept_~s__state~0 8448)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse8 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (and .cse44 .cse5 .cse45 .cse46 .cse31 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)) (.cse25 (<= ssl3_accept_~blastFlag~0 3)) (.cse33 (not (= ssl3_accept_~s__state~0 8657))) (.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse39 (not (= ssl3_accept_~s__state~0 8656))) (.cse36 (<= ssl3_accept_~s__state~0 8672)) (.cse23 (<= 8656 ssl3_accept_~s__state~0)) (.cse9 (not .cse0)) (.cse4 (and .cse44 .cse45 .cse46 .cse31 .cse47 (not .cse42) (not .cse37) .cse48 (not .cse40) .cse15 .cse49 (not .cse38) .cse50 .cse51 (not .cse43) .cse52 (not .cse41))) (.cse32 (<= 8640 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse5 .cse6) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse5 .cse0 (= 8512 ssl3_accept_~s__state~0)) (and .cse6 .cse8) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 (and .cse5 .cse0 (= 8528 ssl3_accept_~s__state~0)) .cse21 (and .cse12 .cse5 .cse13 .cse14 .cse0 .cse16 .cse3 .cse17 .cse18 .cse19) (and .cse5 .cse22 .cse3 .cse23) (and .cse15 .cse7 .cse3 .cse24 .cse10) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse25 .cse7 .cse10) (and .cse26 .cse3 .cse24 .cse10) (and .cse0 .cse27 .cse1 .cse3) .cse28 (and .cse5 .cse22 .cse9 .cse23) .cse29 (and .cse27 .cse4) .cse30 (and (and .cse31 .cse8 .cse9) .cse32) (and .cse12 (not (= ssl3_accept_~s__state~0 8496)) .cse26 .cse13 .cse14 .cse33 (not (= ssl3_accept_~s__state~0 12292)) .cse16 (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8673)) .cse17) (and .cse5 .cse0 .cse7 .cse3 .cse24 .cse10) (and .cse25 .cse22 .cse8 .cse9 .cse23) .cse34 .cse35 (and .cse5 .cse0 (= ssl3_accept_~s__state~0 8560)) (and .cse1 .cse32 .cse3) (and .cse33 .cse15 .cse36 .cse23) .cse37 .cse38 (and .cse25 .cse33 .cse39 .cse9 .cse36 .cse23) .cse40 .cse41 (and .cse25 .cse33 .cse3 .cse39 .cse36 .cse23) (and (= ssl3_accept_~s__state~0 8544) .cse5 .cse0) (and .cse5 .cse31 .cse32 .cse9) .cse42 .cse43 (and .cse4 .cse32))))) [2019-10-02 16:17:52,139 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 430 438) no Hoare annotation was computed. [2019-10-02 16:17:52,139 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-10-02 16:17:52,139 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse4 (= ssl3_accept_~s__hit~0 0)) (.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (<= ssl3_accept_~s__state~0 8448))) (or (= |ssl3_accept_#in~initial_state| 8480) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (and (= 1 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse4) .cse3) (and (<= ssl3_accept_~blastFlag~0 2) .cse4 .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse4 (<= ssl3_accept_~blastFlag~0 3) .cse0 .cse3) (and (= 0 ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3) (= |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|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,140 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ssl3_accept_~s__state~0 8448))) (.cse6 (<= 8448 ssl3_accept_~s__state~0)) (.cse7 (not (= ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8497))) (.cse10 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and (and .cse0 .cse1 (= 0 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 (= 1 ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (= 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|) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 (= ssl3_accept_~s__hit~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10) (= |ssl3_accept_#in~initial_state| 8561))) [2019-10-02 16:17:52,140 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 16:17:52,140 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-10-02 16:17:52,140 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-10-02 16:17:52,140 INFO L443 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2019-10-02 16:17:52,140 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 208 542) no Hoare annotation was computed. [2019-10-02 16:17:52,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:17:52 BoogieIcfgContainer [2019-10-02 16:17:52,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:17:52,205 INFO L168 Benchmark]: Toolchain (without parser) took 53509.21 ms. Allocated memory was 141.0 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 88.6 MB in the beginning and 1.0 GB in the end (delta: -937.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,206 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.27 ms. Allocated memory was 141.0 MB in the beginning and 199.8 MB in the end (delta: 58.7 MB). Free memory was 88.4 MB in the beginning and 173.7 MB in the end (delta: -85.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,207 INFO L168 Benchmark]: Boogie Preprocessor took 66.58 ms. Allocated memory is still 199.8 MB. Free memory was 173.7 MB in the beginning and 170.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,208 INFO L168 Benchmark]: RCFGBuilder took 791.20 ms. Allocated memory is still 199.8 MB. Free memory was 170.8 MB in the beginning and 120.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,209 INFO L168 Benchmark]: TraceAbstraction took 52069.13 ms. Allocated memory was 199.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 120.6 MB in the beginning and 1.0 GB in the end (delta: -905.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-02 16:17:52,212 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.23 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 577.27 ms. Allocated memory was 141.0 MB in the beginning and 199.8 MB in the end (delta: 58.7 MB). Free memory was 88.4 MB in the beginning and 173.7 MB in the end (delta: -85.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.58 ms. Allocated memory is still 199.8 MB. Free memory was 173.7 MB in the beginning and 170.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.20 ms. Allocated memory is still 199.8 MB. Free memory was 170.8 MB in the beginning and 120.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52069.13 ms. Allocated memory was 199.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 120.6 MB in the beginning and 1.0 GB in the end (delta: -905.7 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: 608]: 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: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((!(s__state == 8545) && 8512 <= s__state) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((s__state <= 8576 && s__hit == 0) && ((((blastFlag <= 2 && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560))) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((((((0 == blastFlag && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || (((blastFlag <= 2 && s__hit == 0) && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((0 == blastFlag && s__state <= 8640) && 8576 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (1 == blastFlag && 8608 == s__state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || (((((((((((!(s__state == 8481) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (s__state <= 8576 && (((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497))) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8561 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || (s__state <= 8576 && ((8512 <= s__state && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8560))) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (s__state <= 8576 && ((0 == blastFlag && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560))) || (((((blastFlag <= 2 && 8512 <= s__state) && s__hit == 0) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((((1 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((0 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || ((((((((((!(s__state == 8481) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__state <= 8640) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8497)) && 8466 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__state <= 8640) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && 8466 <= s__state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || (s__state <= 8576 && ((8512 <= s__state && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8560))) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (s__state <= 8576 && ((0 == blastFlag && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560))) || (((((blastFlag <= 2 && 8512 <= s__state) && s__hit == 0) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || (((0 == blastFlag && s__state <= 8656) && !(s__state == 8656)) && 8640 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || ((s__state <= 8640 && 8640 <= s__state) && 1 == blastFlag)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((s__hit == 0 && (((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) || (((((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state))) && 8608 == s__state)) || (blastFlag <= 2 && s__state <= 3)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8544) || ((blastFlag <= 2 && s__hit == 0) && 8512 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((((!(s__state == 8481) && !(s__state == 8545)) && !(s__state == 8480)) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8561) || ((blastFlag <= 2 && s__hit == 0) && 8528 == s__state)) || 8560 == \old(initial_state)) || (((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || (((blastFlag <= 2 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || ((((1 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((0 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || (((s__hit == 0 && 8592 == s__state) && (((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8496) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8480) || (((0 == blastFlag && !(s__state == 8657)) && s__state <= 8672) && 8656 <= s__state)) || (8592 == s__state && (((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state)))) || 8497 == \old(initial_state)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || (((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && 0 == blastFlag) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8608 == s__state)) || (((((((((!(s__state == 8481) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8561)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8497)) && s__state <= 8576)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || ((((((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (8592 == s__state && (((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && 0 == blastFlag) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state)) || (((!(s__state == 8657) && 1 == blastFlag) && s__state <= 8672) && 8656 <= s__state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || (((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && 0 == blastFlag) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8640 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && s__state <= 8672) && 8656 <= s__state)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || (((((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state))) && 8640 <= s__state) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((((s__state <= 8576 && s__hit == 0) && (((((((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(8545 == \old(initial_state))) && blastFlag <= 2) && 8466 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || ((s__state <= 8576 && 8466 <= s__state) && 1 == blastFlag && ((((((((((((((((((((!(\old(initial_state) == 8480) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(8545 == \old(initial_state))) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((s__hit == 0 && (((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) || (((((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state))) && 8608 == s__state)) || (blastFlag <= 2 && s__state <= 3)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8544) || ((blastFlag <= 2 && s__hit == 0) && 8512 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((((!(s__state == 8481) && !(s__state == 8545)) && !(s__state == 8480)) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8561) || ((blastFlag <= 2 && s__hit == 0) && 8528 == s__state)) || 8560 == \old(initial_state)) || (((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || (((blastFlag <= 2 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || ((((1 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((0 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || (((s__hit == 0 && 8592 == s__state) && (((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8496) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8480) || (8592 == s__state && (((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state)))) || 8497 == \old(initial_state)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || ((((((((((!(s__state == 8481) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8497))) || (((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8672) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || ((((((((((((!(\old(initial_state) == 8480) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8561)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && 8576 <= s__state) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 1 == blastFlag) && s__state <= 8672) && 8656 <= s__state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && s__state <= 8672) && 8656 <= s__state)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || (((((((((((((((((!(\old(initial_state) == 8480) && !(8560 == \old(initial_state))) && !(8497 == \old(initial_state))) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8481)) && !(12292 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8656)) && 1 == blastFlag) && !(\old(initial_state) == 8561)) && !(8448 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && !(8657 == \old(initial_state))) && 8576 <= s__state) && !(8545 == \old(initial_state))) && 8640 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((s__state <= 8640 && 1 == blastFlag) && 8576 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((0 == blastFlag && s__state <= 8640) && 8576 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((blastFlag <= 2 && s__hit == 0) && s__state <= 8640) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || !(s__state == 8672)) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((!(s__state == 8545) && 8512 <= s__state) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((s__state <= 8576 && s__hit == 0) && ((((blastFlag <= 2 && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560))) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((((((0 == blastFlag && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((!(s__state == 8544) && 0 == blastFlag) && !(s__state == 8545)) && 8512 <= s__state) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || ((s__state <= 8576 && s__hit == 0) && ((blastFlag <= 2 && !(s__state == 8544)) && !(s__state == 8545)) && 8512 <= s__state)) || 8657 == \old(initial_state)) || (s__state <= 8576 && ((1 == blastFlag && !(s__state == 8544)) && !(s__state == 8545)) && 8512 <= s__state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || ((((blastFlag <= 2 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (((!(s__state == 8672) && 1 == blastFlag) && s__state <= 8672) && 8656 <= s__state)) || (((0 == blastFlag && !(s__state == 8672)) && s__state <= 8672) && 8656 <= s__state)) || ((((blastFlag <= 2 && !(s__state == 8672)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || !(s__state == 8672)) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((!(s__state == 8545) && 8512 <= s__state) && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (s__state <= 8576 && ((((0 == blastFlag && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560))) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (((((((blastFlag <= 2 && !(s__state == 8545)) && 8512 <= s__state) && s__hit == 0) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || (s__state <= 8576 && ((8512 <= s__state && 1 == blastFlag) && !(s__state == 8561)) && !(s__state == 8560))) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || (s__state <= 8576 && ((0 == blastFlag && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560))) || (((((blastFlag <= 2 && 8512 <= s__state) && s__hit == 0) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \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)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((s__state <= 8640 && 1 == blastFlag) && 8576 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || ((0 == blastFlag && s__state <= 8640) && 8576 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((blastFlag <= 2 && s__hit == 0) && s__state <= 8640) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((((((((((((((!(s__state == 8481) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8497)) && !(s__state == 8656))) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((\old(initial_state) == 8480 || ((((0 == blastFlag && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8656)) && 8656 <= s__state)) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8497 == \old(initial_state)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 12292)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && 8656 <= s__state)) || 8545 == \old(initial_state)) || (((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8656)) && !(s__hit == 0)) && 8656 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || ((((!(s__state == 8657) && !(s__state == 12292)) && 1 == blastFlag) && !(s__state == 8656)) && 8656 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 149 locations, 1 error locations. SAFE Result, 51.9s OverallTime, 36 OverallIterations, 24 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 31.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 7401 SDtfs, 8365 SDslu, 6506 SDs, 0 SdLazy, 5918 SolverSat, 1185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2143 GetRequests, 2043 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5032occurred in iteration=28, 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: 2.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 8847 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 255 NumberOfFragments, 4143 HoareAnnotationTreeSize, 32 FomulaSimplifications, 699984 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 32 FomulaSimplificationsInter, 211577 FormulaSimplificationTreeSizeReductionInter, 27.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 9676 NumberOfCodeBlocks, 9676 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 9635 ConstructedInterpolants, 0 QuantifiedInterpolants, 4383374 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3431 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 36027/36132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...