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_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:13,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:13,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:13,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:13,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:13,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:13,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:13,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:13,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:13,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:13,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:13,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:13,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:13,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:13,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:13,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:13,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:13,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:13,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:13,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:13,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:13,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:13,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:13,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:13,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:13,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:13,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:13,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:13,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:13,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:13,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:13,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:13,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:13,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:13,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:13,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:13,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:13,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:13,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:13,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:13,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:13,336 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-13 19:50:13,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:13,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:13,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:13,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:13,356 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:13,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:13,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:13,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:13,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:13,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:13,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:13,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:13,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:13,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:13,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:13,361 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:13,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:13,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:13,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:13,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:13,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:13,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:13,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:13,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:13,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:13,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:13,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:13,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:13,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:13,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:13,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:13,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:13,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:13,685 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:13,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-13 19:50:13,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/354e39e74/72aa4be49283430f8b7bb90c6b62475e/FLAG20e8f67ab [2019-10-13 19:50:14,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:14,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-13 19:50:14,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/354e39e74/72aa4be49283430f8b7bb90c6b62475e/FLAG20e8f67ab [2019-10-13 19:50:14,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/354e39e74/72aa4be49283430f8b7bb90c6b62475e [2019-10-13 19:50:14,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:14,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:14,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:14,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:14,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:14,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:14" (1/1) ... [2019-10-13 19:50:14,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c9c6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:14, skipping insertion in model container [2019-10-13 19:50:14,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:14" (1/1) ... [2019-10-13 19:50:14,597 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:14,650 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:14,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:14,950 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:15,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:15,110 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:15,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15 WrapperNode [2019-10-13 19:50:15,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:15,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:15,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:15,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:15,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (1/1) ... [2019-10-13 19:50:15,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:15,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:15,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:15,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:15,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (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-13 19:50:15,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-13 19:50:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:15,380 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:15,895 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-13 19:50:15,896 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-13 19:50:15,914 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:15,914 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:15,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:15 BoogieIcfgContainer [2019-10-13 19:50:15,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:15,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:15,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:15,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:15,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:14" (1/3) ... [2019-10-13 19:50:15,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486e7cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:15, skipping insertion in model container [2019-10-13 19:50:15,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:15" (2/3) ... [2019-10-13 19:50:15,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486e7cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:15, skipping insertion in model container [2019-10-13 19:50:15,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:15" (3/3) ... [2019-10-13 19:50:15,934 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-13 19:50:15,947 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:15,958 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:15,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:16,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:16,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:16,007 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:16,007 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:16,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:16,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:16,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:16,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-13 19:50:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:50:16,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:16,051 INFO L380 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] [2019-10-13 19:50:16,053 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-13 19:50:16,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:16,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494642410] [2019-10-13 19:50:16,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,325 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-13 19:50:16,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494642410] [2019-10-13 19:50:16,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:16,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:16,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002520133] [2019-10-13 19:50:16,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:16,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:16,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:16,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:16,351 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-13 19:50:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:16,495 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-13 19:50:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:16,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:50:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:16,522 INFO L225 Difference]: With dead ends: 377 [2019-10-13 19:50:16,523 INFO L226 Difference]: Without dead ends: 220 [2019-10-13 19:50:16,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-13 19:50:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-13 19:50:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-13 19:50:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-13 19:50:16,614 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-13 19:50:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:16,615 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-13 19:50:16,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-13 19:50:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:50:16,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:16,619 INFO L380 BasicCegarLoop]: trace histogram [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-13 19:50:16,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-10-13 19:50:16,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:16,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997290267] [2019-10-13 19:50:16,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:16,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997290267] [2019-10-13 19:50:16,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:16,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:16,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941994825] [2019-10-13 19:50:16,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:16,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:16,770 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-13 19:50:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:16,945 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-13 19:50:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:16,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 19:50:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:16,949 INFO L225 Difference]: With dead ends: 470 [2019-10-13 19:50:16,949 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 19:50:16,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 19:50:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-13 19:50:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-13 19:50:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-13 19:50:16,995 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-13 19:50:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:16,995 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-13 19:50:16,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-13 19:50:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:16,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:16,999 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:50:17,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-10-13 19:50:17,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074839044] [2019-10-13 19:50:17,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:50:17,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074839044] [2019-10-13 19:50:17,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:17,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:17,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752677818] [2019-10-13 19:50:17,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:17,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:17,130 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-13 19:50:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:17,334 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-13 19:50:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:17,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:17,337 INFO L225 Difference]: With dead ends: 598 [2019-10-13 19:50:17,338 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 19:50:17,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 19:50:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-13 19:50:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 19:50:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-13 19:50:17,358 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-13 19:50:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:17,359 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-13 19:50:17,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-13 19:50:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:17,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:17,362 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:50:17,363 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-10-13 19:50:17,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415559705] [2019-10-13 19:50:17,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:50:17,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415559705] [2019-10-13 19:50:17,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:17,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:17,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452351820] [2019-10-13 19:50:17,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:17,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:17,426 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-13 19:50:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:17,602 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-13 19:50:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:17,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:17,608 INFO L225 Difference]: With dead ends: 708 [2019-10-13 19:50:17,608 INFO L226 Difference]: Without dead ends: 384 [2019-10-13 19:50:17,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-13 19:50:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-13 19:50:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-13 19:50:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-13 19:50:17,629 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-13 19:50:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:17,630 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-13 19:50:17,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-13 19:50:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:50:17,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:17,635 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:17,635 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-10-13 19:50:17,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107927074] [2019-10-13 19:50:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:50:17,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107927074] [2019-10-13 19:50:17,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:17,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:17,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930881] [2019-10-13 19:50:17,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:17,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:17,713 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-13 19:50:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:17,904 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-13 19:50:17,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:17,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-13 19:50:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:17,907 INFO L225 Difference]: With dead ends: 842 [2019-10-13 19:50:17,908 INFO L226 Difference]: Without dead ends: 478 [2019-10-13 19:50:17,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-13 19:50:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-13 19:50:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-13 19:50:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-13 19:50:17,925 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-13 19:50:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:17,926 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-13 19:50:17,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-13 19:50:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 19:50:17,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:17,929 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:17,929 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-10-13 19:50:17,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730182924] [2019-10-13 19:50:17,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 19:50:17,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730182924] [2019-10-13 19:50:17,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:17,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:17,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316863397] [2019-10-13 19:50:17,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:17,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:17,998 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-13 19:50:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:18,156 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-13 19:50:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:18,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 19:50:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:18,160 INFO L225 Difference]: With dead ends: 940 [2019-10-13 19:50:18,161 INFO L226 Difference]: Without dead ends: 500 [2019-10-13 19:50:18,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-13 19:50:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-13 19:50:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-13 19:50:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-13 19:50:18,179 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-13 19:50:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:18,180 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-13 19:50:18,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-13 19:50:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 19:50:18,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:18,182 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:18,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-10-13 19:50:18,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:18,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76849688] [2019-10-13 19:50:18,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:18,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76849688] [2019-10-13 19:50:18,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606335231] [2019-10-13 19:50:18,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,264 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-13 19:50:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:18,306 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-13 19:50:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:18,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 19:50:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:18,311 INFO L225 Difference]: With dead ends: 976 [2019-10-13 19:50:18,312 INFO L226 Difference]: Without dead ends: 734 [2019-10-13 19:50:18,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-13 19:50:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-13 19:50:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-13 19:50:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-13 19:50:18,337 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-13 19:50:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:18,337 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-13 19:50:18,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-13 19:50:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:50:18,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:18,340 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:18,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-10-13 19:50:18,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:18,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185007302] [2019-10-13 19:50:18,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 19:50:18,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185007302] [2019-10-13 19:50:18,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505649126] [2019-10-13 19:50:18,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,459 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-13 19:50:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:18,502 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-13 19:50:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:18,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-13 19:50:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:18,510 INFO L225 Difference]: With dead ends: 976 [2019-10-13 19:50:18,510 INFO L226 Difference]: Without dead ends: 974 [2019-10-13 19:50:18,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-13 19:50:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-13 19:50:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-13 19:50:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-13 19:50:18,539 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-13 19:50:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:18,540 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-13 19:50:18,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-13 19:50:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 19:50:18,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:18,544 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-10-13 19:50:18,544 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-10-13 19:50:18,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:18,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936889403] [2019-10-13 19:50:18,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-13 19:50:18,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936889403] [2019-10-13 19:50:18,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910636118] [2019-10-13 19:50:18,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,615 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-13 19:50:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:18,805 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-13 19:50:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:18,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-13 19:50:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:18,812 INFO L225 Difference]: With dead ends: 2140 [2019-10-13 19:50:18,812 INFO L226 Difference]: Without dead ends: 1170 [2019-10-13 19:50:18,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-13 19:50:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-13 19:50:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-13 19:50:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-13 19:50:18,850 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-10-13 19:50:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:18,851 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-13 19:50:18,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-13 19:50:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 19:50:18,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:18,856 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:18,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-10-13 19:50:18,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:18,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022465440] [2019-10-13 19:50:18,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-13 19:50:18,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022465440] [2019-10-13 19:50:18,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424248861] [2019-10-13 19:50:18,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,951 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-13 19:50:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:19,105 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-13 19:50:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:19,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-13 19:50:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:19,113 INFO L225 Difference]: With dead ends: 2354 [2019-10-13 19:50:19,114 INFO L226 Difference]: Without dead ends: 1236 [2019-10-13 19:50:19,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-13 19:50:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-13 19:50:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-13 19:50:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-13 19:50:19,159 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-10-13 19:50:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:19,160 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-13 19:50:19,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-13 19:50:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-13 19:50:19,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:19,168 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:19,169 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-10-13 19:50:19,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:19,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341577913] [2019-10-13 19:50:19,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-13 19:50:19,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341577913] [2019-10-13 19:50:19,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:19,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:19,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277310301] [2019-10-13 19:50:19,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:19,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:19,275 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-13 19:50:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:19,452 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-13 19:50:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:19,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-13 19:50:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:19,460 INFO L225 Difference]: With dead ends: 2544 [2019-10-13 19:50:19,460 INFO L226 Difference]: Without dead ends: 1334 [2019-10-13 19:50:19,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-13 19:50:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-13 19:50:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-13 19:50:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-13 19:50:19,502 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-10-13 19:50:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:19,503 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-13 19:50:19,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-13 19:50:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-13 19:50:19,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:19,509 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:19,509 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-10-13 19:50:19,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:19,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566222636] [2019-10-13 19:50:19,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 19:50:19,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566222636] [2019-10-13 19:50:19,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:19,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:19,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156493349] [2019-10-13 19:50:19,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:19,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:19,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:19,606 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-13 19:50:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:19,800 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-13 19:50:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:19,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-13 19:50:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:19,812 INFO L225 Difference]: With dead ends: 2752 [2019-10-13 19:50:19,812 INFO L226 Difference]: Without dead ends: 1442 [2019-10-13 19:50:19,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-13 19:50:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-13 19:50:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-13 19:50:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-13 19:50:19,878 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-10-13 19:50:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:19,879 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-13 19:50:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-13 19:50:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-13 19:50:19,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:19,890 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:19,890 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-10-13 19:50:19,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:19,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144245842] [2019-10-13 19:50:19,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 19:50:20,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144245842] [2019-10-13 19:50:20,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:20,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:20,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159970752] [2019-10-13 19:50:20,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:20,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:20,110 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-13 19:50:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:20,341 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-13 19:50:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:20,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-13 19:50:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:20,349 INFO L225 Difference]: With dead ends: 2992 [2019-10-13 19:50:20,350 INFO L226 Difference]: Without dead ends: 1570 [2019-10-13 19:50:20,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-13 19:50:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-13 19:50:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-13 19:50:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-13 19:50:20,403 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-10-13 19:50:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:20,403 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-13 19:50:20,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-13 19:50:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-13 19:50:20,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:20,410 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:20,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-10-13 19:50:20,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:20,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65803261] [2019-10-13 19:50:20,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-10-13 19:50:20,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65803261] [2019-10-13 19:50:20,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:20,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:20,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778078245] [2019-10-13 19:50:20,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:20,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:20,571 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-13 19:50:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:20,635 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-13 19:50:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:20,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-13 19:50:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:20,653 INFO L225 Difference]: With dead ends: 4646 [2019-10-13 19:50:20,653 INFO L226 Difference]: Without dead ends: 3100 [2019-10-13 19:50:20,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-13 19:50:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-13 19:50:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-13 19:50:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-13 19:50:20,745 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-10-13 19:50:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:20,746 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-13 19:50:20,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-13 19:50:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-13 19:50:20,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:20,756 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:20,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-10-13 19:50:20,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:20,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044549882] [2019-10-13 19:50:20,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-13 19:50:20,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044549882] [2019-10-13 19:50:20,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:20,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:20,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997290850] [2019-10-13 19:50:20,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:20,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:20,876 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-13 19:50:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,096 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-13 19:50:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:21,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-13 19:50:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,116 INFO L225 Difference]: With dead ends: 6484 [2019-10-13 19:50:21,116 INFO L226 Difference]: Without dead ends: 3398 [2019-10-13 19:50:21,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-13 19:50:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-13 19:50:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-13 19:50:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-13 19:50:21,272 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-10-13 19:50:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:21,273 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-13 19:50:21,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-13 19:50:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-13 19:50:21,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:21,283 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:21,283 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-10-13 19:50:21,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:21,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727262509] [2019-10-13 19:50:21,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-10-13 19:50:21,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727262509] [2019-10-13 19:50:21,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477812176] [2019-10-13 19:50:21,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,420 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-13 19:50:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,619 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-13 19:50:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:21,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-13 19:50:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,639 INFO L225 Difference]: With dead ends: 6900 [2019-10-13 19:50:21,639 INFO L226 Difference]: Without dead ends: 3530 [2019-10-13 19:50:21,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-13 19:50:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-13 19:50:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-13 19:50:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-13 19:50:21,751 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-10-13 19:50:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:21,752 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-13 19:50:21,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-13 19:50:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-13 19:50:21,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:21,763 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:21,763 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-10-13 19:50:21,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:21,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451840814] [2019-10-13 19:50:21,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-13 19:50:21,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451840814] [2019-10-13 19:50:21,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99937837] [2019-10-13 19:50:21,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,932 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-13 19:50:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,143 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-13 19:50:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-13 19:50:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,164 INFO L225 Difference]: With dead ends: 7416 [2019-10-13 19:50:22,165 INFO L226 Difference]: Without dead ends: 3914 [2019-10-13 19:50:22,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-13 19:50:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-13 19:50:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-13 19:50:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-13 19:50:22,271 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-10-13 19:50:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,271 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-13 19:50:22,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-13 19:50:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-13 19:50:22,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,284 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:22,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-10-13 19:50:22,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491383371] [2019-10-13 19:50:22,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-10-13 19:50:22,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491383371] [2019-10-13 19:50:22,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:22,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:22,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998271240] [2019-10-13 19:50:22,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:22,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:22,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:22,457 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-13 19:50:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,680 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-13 19:50:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-13 19:50:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,701 INFO L225 Difference]: With dead ends: 8048 [2019-10-13 19:50:22,702 INFO L226 Difference]: Without dead ends: 4234 [2019-10-13 19:50:22,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-13 19:50:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-13 19:50:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-13 19:50:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-13 19:50:22,806 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-10-13 19:50:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-13 19:50:22,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-13 19:50:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-13 19:50:22,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,818 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:22,818 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-10-13 19:50:22,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46896937] [2019-10-13 19:50:22,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-13 19:50:22,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46896937] [2019-10-13 19:50:22,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:22,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:22,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864290685] [2019-10-13 19:50:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:22,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:22,968 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-13 19:50:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,071 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-13 19:50:23,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-13 19:50:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,094 INFO L225 Difference]: With dead ends: 11310 [2019-10-13 19:50:23,094 INFO L226 Difference]: Without dead ends: 7376 [2019-10-13 19:50:23,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-13 19:50:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-13 19:50:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-13 19:50:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-13 19:50:23,361 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-10-13 19:50:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:23,362 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-13 19:50:23,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-13 19:50:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-13 19:50:23,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:23,388 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:23,389 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-10-13 19:50:23,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:23,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177235232] [2019-10-13 19:50:23,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-13 19:50:23,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177235232] [2019-10-13 19:50:23,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:23,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:23,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696802038] [2019-10-13 19:50:23,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:23,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:23,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:23,627 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-13 19:50:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,948 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-13 19:50:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-13 19:50:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,971 INFO L225 Difference]: With dead ends: 14744 [2019-10-13 19:50:23,972 INFO L226 Difference]: Without dead ends: 7382 [2019-10-13 19:50:23,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-13 19:50:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-13 19:50:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-13 19:50:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-13 19:50:24,159 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-10-13 19:50:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:24,160 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-13 19:50:24,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-13 19:50:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-13 19:50:24,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:24,177 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 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-13 19:50:24,177 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-10-13 19:50:24,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:24,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585055950] [2019-10-13 19:50:24,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-13 19:50:24,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585055950] [2019-10-13 19:50:24,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632869137] [2019-10-13 19:50:24,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:50:24,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-10-13 19:50:24,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:24,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-13 19:50:24,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463614910] [2019-10-13 19:50:24,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:24,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:50:24,914 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2019-10-13 19:50:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:25,415 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2019-10-13 19:50:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:25,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2019-10-13 19:50:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:25,432 INFO L225 Difference]: With dead ends: 14866 [2019-10-13 19:50:25,433 INFO L226 Difference]: Without dead ends: 7500 [2019-10-13 19:50:25,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:50:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2019-10-13 19:50:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2019-10-13 19:50:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-13 19:50:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-13 19:50:25,657 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 353 [2019-10-13 19:50:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:25,658 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-13 19:50:25,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-13 19:50:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-13 19:50:25,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:25,677 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:25,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:25,882 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1456365214, now seen corresponding path program 1 times [2019-10-13 19:50:25,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:25,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541580882] [2019-10-13 19:50:25,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-13 19:50:26,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541580882] [2019-10-13 19:50:26,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135637128] [2019-10-13 19:50:26,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:26,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-13 19:50:26,621 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:26,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:26,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890511882] [2019-10-13 19:50:26,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:26,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:26,625 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2019-10-13 19:50:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:27,138 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2019-10-13 19:50:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:27,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-10-13 19:50:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:27,162 INFO L225 Difference]: With dead ends: 14624 [2019-10-13 19:50:27,162 INFO L226 Difference]: Without dead ends: 11034 [2019-10-13 19:50:27,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 370 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-13 19:50:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-10-13 19:50:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-10-13 19:50:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-13 19:50:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-13 19:50:27,444 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 366 [2019-10-13 19:50:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:27,445 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-13 19:50:27,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-13 19:50:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-13 19:50:27,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,564 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:27,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:27,765 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 2 times [2019-10-13 19:50:27,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54204366] [2019-10-13 19:50:27,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-13 19:50:27,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54204366] [2019-10-13 19:50:27,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269328302] [2019-10-13 19:50:27,939 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:28,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:50:28,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:50:28,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:28,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-13 19:50:28,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:28,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:28,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698795184] [2019-10-13 19:50:28,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:28,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:28,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:28,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:28,169 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-10-13 19:50:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:28,624 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-10-13 19:50:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:28,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-13 19:50:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:28,648 INFO L225 Difference]: With dead ends: 19118 [2019-10-13 19:50:28,649 INFO L226 Difference]: Without dead ends: 10668 [2019-10-13 19:50:28,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 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-13 19:50:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-10-13 19:50:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-10-13 19:50:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-10-13 19:50:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-10-13 19:50:29,015 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-10-13 19:50:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:29,016 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-10-13 19:50:29,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-10-13 19:50:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-13 19:50:29,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:29,039 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:29,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:29,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-10-13 19:50:29,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:29,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011944585] [2019-10-13 19:50:29,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-13 19:50:29,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011944585] [2019-10-13 19:50:29,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:29,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:29,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756571820] [2019-10-13 19:50:29,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:29,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:29,483 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-10-13 19:50:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:29,789 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-10-13 19:50:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:29,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-13 19:50:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:29,802 INFO L225 Difference]: With dead ends: 15876 [2019-10-13 19:50:29,802 INFO L226 Difference]: Without dead ends: 3820 [2019-10-13 19:50:29,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 19:50:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-10-13 19:50:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-10-13 19:50:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-10-13 19:50:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-10-13 19:50:29,921 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-10-13 19:50:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:29,922 INFO L462 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-10-13 19:50:29,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-10-13 19:50:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-10-13 19:50:29,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:29,952 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:29,953 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-10-13 19:50:29,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:29,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430359333] [2019-10-13 19:50:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-10-13 19:50:30,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430359333] [2019-10-13 19:50:30,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983971845] [2019-10-13 19:50:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:30,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-13 19:50:31,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:31,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:31,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280279594] [2019-10-13 19:50:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:31,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:31,082 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 3 states. [2019-10-13 19:50:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:31,152 INFO L93 Difference]: Finished difference Result 4045 states and 5016 transitions. [2019-10-13 19:50:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:31,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 516 [2019-10-13 19:50:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:31,166 INFO L225 Difference]: With dead ends: 4045 [2019-10-13 19:50:31,166 INFO L226 Difference]: Without dead ends: 3968 [2019-10-13 19:50:31,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-10-13 19:50:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3535. [2019-10-13 19:50:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-10-13 19:50:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4415 transitions. [2019-10-13 19:50:31,264 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4415 transitions. Word has length 516 [2019-10-13 19:50:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:31,265 INFO L462 AbstractCegarLoop]: Abstraction has 3535 states and 4415 transitions. [2019-10-13 19:50:31,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4415 transitions. [2019-10-13 19:50:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-10-13 19:50:31,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:31,311 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:31,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:31,518 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1541123714, now seen corresponding path program 1 times [2019-10-13 19:50:31,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:31,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613745600] [2019-10-13 19:50:31,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-13 19:50:31,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613745600] [2019-10-13 19:50:31,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674310217] [2019-10-13 19:50:31,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:32,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-13 19:50:32,418 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:32,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:32,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623789919] [2019-10-13 19:50:32,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:32,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:32,421 INFO L87 Difference]: Start difference. First operand 3535 states and 4415 transitions. Second operand 4 states. [2019-10-13 19:50:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,664 INFO L93 Difference]: Finished difference Result 4397 states and 5486 transitions. [2019-10-13 19:50:32,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:32,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 628 [2019-10-13 19:50:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,666 INFO L225 Difference]: With dead ends: 4397 [2019-10-13 19:50:32,666 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:50:32,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 632 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-13 19:50:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:50:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:50:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:50:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:50:32,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2019-10-13 19:50:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,672 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:50:32,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:50:32,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:50:32,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:32,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:50:33,943 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 100 [2019-10-13 19:50:34,069 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-10-13 19:50:34,435 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-10-13 19:50:34,883 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-10-13 19:50:34,992 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-10-13 19:50:35,604 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-10-13 19:50:35,672 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:50:35,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:35,672 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-13 19:50:35,673 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-13 19:50:35,673 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-13 19:50:35,673 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-13 19:50:35,673 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-13 19:50:35,673 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-13 19:50:35,673 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-13 19:50:35,673 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-10-13 19:50:35,674 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-13 19:50:35,675 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-13 19:50:35,675 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-13 19:50:35,675 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2019-10-13 19:50:35,675 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-13 19:50:35,677 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-13 19:50:35,679 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-13 19:50:35,679 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-13 19:50:35,679 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-13 19:50:35,679 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-13 19:50:35,679 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-13 19:50:35,679 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-10-13 19:50:35,680 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-13 19:50:35,681 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-13 19:50:35,681 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-13 19:50:35,681 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-13 19:50:35,682 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-13 19:50:35,682 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-13 19:50:35,683 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-13 19:50:35,683 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-13 19:50:35,683 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-13 19:50:35,683 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-13 19:50:35,683 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-13 19:50:35,684 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-13 19:50:35,685 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-13 19:50:35,685 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-13 19:50:35,686 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-13 19:50:35,687 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-10-13 19:50:35,687 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse16 (= 4400 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse9) (and .cse5 .cse0 .cse1) (and .cse12 .cse6 .cse1) (and .cse3 .cse13 .cse1) (and .cse6 .cse5) (and .cse3 .cse14 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse15) (and .cse12 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse13 .cse0 .cse1) (and .cse3 .cse0 .cse16 .cse1) (and .cse6 .cse14) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse1 .cse17) (and .cse6 .cse16 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse10 .cse11 .cse1 .cse15) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse17) (<= ssl3_connect_~blastFlag~0 0)))) [2019-10-13 19:50:35,688 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-13 19:50:35,688 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-13 19:50:35,689 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-13 19:50:35,689 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-13 19:50:35,690 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-13 19:50:35,691 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2019-10-13 19:50:35,692 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-13 19:50:35,692 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-13 19:50:35,693 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-13 19:50:35,693 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-13 19:50:35,693 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-10-13 19:50:35,693 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-13 19:50:35,693 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-13 19:50:35,693 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-10-13 19:50:35,693 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-13 19:50:35,694 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-13 19:50:35,694 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:35,695 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:50:35,695 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:50:35,695 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:50:35,695 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-13 19:50:35,695 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-10-13 19:50:35,695 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-10-13 19:50:35,695 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-10-13 19:50:35,695 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-10-13 19:50:35,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:50:35 BoogieIcfgContainer [2019-10-13 19:50:35,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:50:35,757 INFO L168 Benchmark]: Toolchain (without parser) took 21168.19 ms. Allocated memory was 138.4 MB in the beginning and 1.1 GB in the end (delta: 947.9 MB). Free memory was 102.0 MB in the beginning and 320.9 MB in the end (delta: -218.9 MB). Peak memory consumption was 729.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,761 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 177.8 MB in the end (delta: -76.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,762 INFO L168 Benchmark]: Boogie Preprocessor took 62.50 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,763 INFO L168 Benchmark]: RCFGBuilder took 742.58 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 128.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,764 INFO L168 Benchmark]: TraceAbstraction took 19830.40 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 884.5 MB). Free memory was 128.8 MB in the beginning and 320.9 MB in the end (delta: -192.1 MB). Peak memory consumption was 692.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:35,769 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.43 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 527.90 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 177.8 MB in the end (delta: -76.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.50 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 742.58 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 128.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19830.40 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 884.5 MB). Free memory was 128.8 MB in the beginning and 320.9 MB in the end (delta: -192.1 MB). Peak memory consumption was 692.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || blastFlag <= 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 19.6s, OverallIterations: 26, TraceHistogramMax: 22, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 5408 SDtfs, 1932 SDslu, 3225 SDs, 0 SdLazy, 2605 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2379 GetRequests, 2340 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 6109 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 20317 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2059 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 8697 NumberOfCodeBlocks, 8697 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8666 ConstructedInterpolants, 0 QuantifiedInterpolants, 4528166 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4056 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 37661/37743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...