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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:40,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:40,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:40,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:40,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:40,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:40,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:40,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:40,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:40,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:40,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:40,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:40,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:40,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:40,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:40,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:40,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:40,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:40,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:40,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:40,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:40,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:40,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:40,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:40,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:40,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:40,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:40,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:40,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:40,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:40,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:40,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:40,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:40,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:40,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:40,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:40,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:40,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:40,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:40,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:40,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:40,190 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-15 03:30:40,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:40,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:40,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:40,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:40,226 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:40,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:40,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:40,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:40,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:40,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:40,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:40,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:40,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:40,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:40,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:40,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:40,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:40,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:40,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:40,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:40,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:40,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:40,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:40,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:30:40,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:40,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:40,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:40,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:40,520 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:40,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-15 03:30:40,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd36dd6b8/e9f66b51d107430292838d73eefd87d4/FLAG8dcee11b2 [2019-10-15 03:30:41,074 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:41,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-15 03:30:41,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd36dd6b8/e9f66b51d107430292838d73eefd87d4/FLAG8dcee11b2 [2019-10-15 03:30:41,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd36dd6b8/e9f66b51d107430292838d73eefd87d4 [2019-10-15 03:30:41,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:41,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:41,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:41,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:41,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:41,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cce3650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41, skipping insertion in model container [2019-10-15 03:30:41,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,441 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:41,479 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:30:41,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:41,734 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:30:41,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:41,924 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:30:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41 WrapperNode [2019-10-15 03:30:41,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:41,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:30:41,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:30:41,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:30:41,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (1/1) ... [2019-10-15 03:30:41,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:30:41,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:30:41,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:30:41,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:30:41,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (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-15 03:30:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:30:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:30:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 03:30:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:30:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:30:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:30:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:30:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:30:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:30:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 03:30:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:30:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:30:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:30:42,215 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:30:42,700 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 03:30:42,700 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 03:30:43,051 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:30:43,052 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:30:43,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:43 BoogieIcfgContainer [2019-10-15 03:30:43,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:30:43,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:30:43,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:30:43,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:30:43,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:41" (1/3) ... [2019-10-15 03:30:43,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742db6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:43, skipping insertion in model container [2019-10-15 03:30:43,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:41" (2/3) ... [2019-10-15 03:30:43,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742db6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:43, skipping insertion in model container [2019-10-15 03:30:43,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:43" (3/3) ... [2019-10-15 03:30:43,062 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-10-15 03:30:43,071 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:30:43,082 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:30:43,096 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:30:43,142 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:30:43,142 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:30:43,142 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:30:43,143 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:30:43,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:30:43,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:30:43,143 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:30:43,143 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:30:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 03:30:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:30:43,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:43,190 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] [2019-10-15 03:30:43,193 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash -842997927, now seen corresponding path program 1 times [2019-10-15 03:30:43,211 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:43,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455818582] [2019-10-15 03:30:43,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:43,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:43,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:43,562 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-15 03:30:43,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455818582] [2019-10-15 03:30:43,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:43,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:43,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505551703] [2019-10-15 03:30:43,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:43,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:43,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:43,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:43,592 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-10-15 03:30:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:43,870 INFO L93 Difference]: Finished difference Result 212 states and 355 transitions. [2019-10-15 03:30:43,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:43,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:30:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:43,885 INFO L225 Difference]: With dead ends: 212 [2019-10-15 03:30:43,885 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 03:30:43,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 03:30:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-10-15 03:30:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 03:30:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2019-10-15 03:30:43,957 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 25 [2019-10-15 03:30:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:43,958 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2019-10-15 03:30:43,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2019-10-15 03:30:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:30:43,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:43,962 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] [2019-10-15 03:30:43,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -367817731, now seen corresponding path program 1 times [2019-10-15 03:30:43,964 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:43,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958048366] [2019-10-15 03:30:43,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:43,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:44,101 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-15 03:30:44,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958048366] [2019-10-15 03:30:44,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:44,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:44,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606269583] [2019-10-15 03:30:44,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:44,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:44,106 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand 5 states. [2019-10-15 03:30:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:44,344 INFO L93 Difference]: Finished difference Result 238 states and 362 transitions. [2019-10-15 03:30:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:44,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:30:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:44,348 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:30:44,348 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 03:30:44,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 03:30:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2019-10-15 03:30:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-15 03:30:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2019-10-15 03:30:44,368 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 26 [2019-10-15 03:30:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:44,368 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2019-10-15 03:30:44,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2019-10-15 03:30:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:30:44,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:44,374 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:44,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash -410142333, now seen corresponding path program 1 times [2019-10-15 03:30:44,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:44,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284955532] [2019-10-15 03:30:44,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:44,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:44,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:44,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284955532] [2019-10-15 03:30:44,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:44,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:44,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443648193] [2019-10-15 03:30:44,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:44,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:44,493 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand 5 states. [2019-10-15 03:30:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:44,724 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2019-10-15 03:30:44,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:44,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:30:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:44,730 INFO L225 Difference]: With dead ends: 276 [2019-10-15 03:30:44,730 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:44,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-10-15 03:30:44,756 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 43 [2019-10-15 03:30:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:44,756 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-10-15 03:30:44,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-10-15 03:30:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:30:44,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:44,760 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:44,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2057265607, now seen corresponding path program 1 times [2019-10-15 03:30:44,761 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:44,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582998602] [2019-10-15 03:30:44,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:44,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:44,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:44,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582998602] [2019-10-15 03:30:44,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:44,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:44,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608134421] [2019-10-15 03:30:44,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:44,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:44,845 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 5 states. [2019-10-15 03:30:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:45,043 INFO L93 Difference]: Finished difference Result 295 states and 461 transitions. [2019-10-15 03:30:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:45,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:30:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:45,045 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:30:45,045 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:45,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-10-15 03:30:45,075 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 44 [2019-10-15 03:30:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:45,076 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-10-15 03:30:45,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-10-15 03:30:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:30:45,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:45,082 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:45,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2136923177, now seen corresponding path program 1 times [2019-10-15 03:30:45,083 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:45,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287154520] [2019-10-15 03:30:45,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:45,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287154520] [2019-10-15 03:30:45,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:45,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:45,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873367038] [2019-10-15 03:30:45,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:45,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:45,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:45,160 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 5 states. [2019-10-15 03:30:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:45,347 INFO L93 Difference]: Finished difference Result 314 states and 490 transitions. [2019-10-15 03:30:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:45,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:30:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:45,349 INFO L225 Difference]: With dead ends: 314 [2019-10-15 03:30:45,349 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:45,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2019-10-15 03:30:45,362 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 59 [2019-10-15 03:30:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:45,362 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2019-10-15 03:30:45,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2019-10-15 03:30:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:30:45,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:45,364 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:45,365 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1170946235, now seen corresponding path program 1 times [2019-10-15 03:30:45,365 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:45,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415672761] [2019-10-15 03:30:45,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:45,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415672761] [2019-10-15 03:30:45,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:45,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:45,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268730061] [2019-10-15 03:30:45,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:45,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:45,434 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand 5 states. [2019-10-15 03:30:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:45,621 INFO L93 Difference]: Finished difference Result 331 states and 514 transitions. [2019-10-15 03:30:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:45,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:30:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:45,623 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:30:45,623 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:45,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2019-10-15 03:30:45,636 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 60 [2019-10-15 03:30:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:45,636 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2019-10-15 03:30:45,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2019-10-15 03:30:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:30:45,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:45,640 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:45,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:45,641 INFO L82 PathProgramCache]: Analyzing trace with hash -596566892, now seen corresponding path program 1 times [2019-10-15 03:30:45,641 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:45,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62672631] [2019-10-15 03:30:45,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:45,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62672631] [2019-10-15 03:30:45,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:45,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:45,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559986280] [2019-10-15 03:30:45,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:45,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:45,731 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand 5 states. [2019-10-15 03:30:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:45,946 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2019-10-15 03:30:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:45,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:30:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:45,948 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:30:45,948 INFO L226 Difference]: Without dead ends: 205 [2019-10-15 03:30:45,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-15 03:30:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-15 03:30:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:30:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2019-10-15 03:30:45,966 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 62 [2019-10-15 03:30:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:45,966 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2019-10-15 03:30:45,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2019-10-15 03:30:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:30:45,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:45,969 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:45,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash -741946462, now seen corresponding path program 1 times [2019-10-15 03:30:45,970 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:45,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098440988] [2019-10-15 03:30:45,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:45,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 03:30:46,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098440988] [2019-10-15 03:30:46,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:46,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:46,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159999771] [2019-10-15 03:30:46,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:46,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:46,049 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand 5 states. [2019-10-15 03:30:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:46,233 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2019-10-15 03:30:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:46,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:30:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:46,235 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:30:46,235 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:46,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2019-10-15 03:30:46,251 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 72 [2019-10-15 03:30:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:46,252 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2019-10-15 03:30:46,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2019-10-15 03:30:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:30:46,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:46,253 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:46,254 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -345014114, now seen corresponding path program 1 times [2019-10-15 03:30:46,254 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:46,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007446379] [2019-10-15 03:30:46,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 03:30:46,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007446379] [2019-10-15 03:30:46,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:46,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:46,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851310167] [2019-10-15 03:30:46,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:46,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:46,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:46,324 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand 5 states. [2019-10-15 03:30:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:46,480 INFO L93 Difference]: Finished difference Result 435 states and 677 transitions. [2019-10-15 03:30:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:46,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:30:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:46,484 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:30:46,485 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:46,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-10-15 03:30:46,497 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 73 [2019-10-15 03:30:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:46,497 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-10-15 03:30:46,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-10-15 03:30:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:30:46,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:46,499 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:46,499 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1745624304, now seen corresponding path program 1 times [2019-10-15 03:30:46,500 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:46,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512658890] [2019-10-15 03:30:46,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-15 03:30:46,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512658890] [2019-10-15 03:30:46,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:46,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:46,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590307840] [2019-10-15 03:30:46,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:46,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:46,548 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 5 states. [2019-10-15 03:30:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:46,702 INFO L93 Difference]: Finished difference Result 448 states and 689 transitions. [2019-10-15 03:30:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:46,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 03:30:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:46,704 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:30:46,704 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:46,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2019-10-15 03:30:46,716 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 83 [2019-10-15 03:30:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:46,717 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2019-10-15 03:30:46,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2019-10-15 03:30:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:30:46,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:46,718 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:46,718 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1572060468, now seen corresponding path program 1 times [2019-10-15 03:30:46,719 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:46,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080701103] [2019-10-15 03:30:46,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-15 03:30:46,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080701103] [2019-10-15 03:30:46,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:46,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:46,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003633632] [2019-10-15 03:30:46,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:46,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:46,770 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand 5 states. [2019-10-15 03:30:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:46,958 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-10-15 03:30:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:46,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 03:30:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:46,960 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:30:46,960 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:46,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 346 transitions. [2019-10-15 03:30:46,972 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 346 transitions. Word has length 84 [2019-10-15 03:30:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:46,973 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 346 transitions. [2019-10-15 03:30:46,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 346 transitions. [2019-10-15 03:30:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:30:46,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:46,974 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:46,975 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -595531095, now seen corresponding path program 1 times [2019-10-15 03:30:46,975 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:46,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770469186] [2019-10-15 03:30:46,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:46,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:47,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770469186] [2019-10-15 03:30:47,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674470575] [2019-10-15 03:30:47,055 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-15 03:30:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:30:47,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:30:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 03:30:47,197 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:30:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 03:30:47,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1132887620] [2019-10-15 03:30:47,333 INFO L162 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-10-15 03:30:47,333 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:30:47,340 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:30:47,354 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:30:47,355 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:30:47,423 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:30:47,430 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_connect with input of size 3 for LOIs [2019-10-15 03:30:49,997 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2019-10-15 03:31:16,134 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 204 [2019-10-15 03:31:18,753 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 207 [2019-10-15 03:31:18,857 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 206