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_4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:54,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:54,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:54,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:54,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:54,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:54,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:54,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:54,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:54,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:54,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:54,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:54,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:54,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:54,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:54,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:54,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:54,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:54,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:54,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:54,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:54,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:54,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:54,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:54,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:54,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:54,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:54,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:54,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:54,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:54,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:54,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:54,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:54,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:54,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:54,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:54,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:54,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:54,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:54,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:54,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:54,913 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:54,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:54,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:54,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:54,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:54,950 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:54,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:54,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:54,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:54,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:54,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:54,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:54,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:54,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:54,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:54,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:54,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:54,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:54,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:54,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:54,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:54,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:54,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:54,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:54,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:54,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:54,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:54,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:54,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:54,955 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:55,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:55,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:55,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:55,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:55,249 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:55,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-2.c [2019-10-15 03:30:55,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e02c4987/1e82bc318550411ca437b7ae4180dafe/FLAG1312a7b6b [2019-10-15 03:30:55,833 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:55,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-2.c [2019-10-15 03:30:55,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e02c4987/1e82bc318550411ca437b7ae4180dafe/FLAG1312a7b6b [2019-10-15 03:30:56,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e02c4987/1e82bc318550411ca437b7ae4180dafe [2019-10-15 03:30:56,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:56,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:56,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:56,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:56,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:56,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:56" (1/1) ... [2019-10-15 03:30:56,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6bfa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:56, skipping insertion in model container [2019-10-15 03:30:56,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:56" (1/1) ... [2019-10-15 03:30:56,193 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:56,247 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:30:56,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:56,669 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:30:56,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:56,754 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:30:56,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:56 WrapperNode [2019-10-15 03:30:56,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:56,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:30:56,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:30:56,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:30:56,769 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:56" (1/1) ... [2019-10-15 03:30:56,776 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:56" (1/1) ... [2019-10-15 03:30:56,800 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:56" (1/1) ... [2019-10-15 03:30:56,801 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:56" (1/1) ... [2019-10-15 03:30:56,816 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:56" (1/1) ... [2019-10-15 03:30:56,829 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:56" (1/1) ... [2019-10-15 03:30:56,832 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:56" (1/1) ... [2019-10-15 03:30:56,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:30:56,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:30:56,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:30:56,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:30:56,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:30:56,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:30:56,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 03:30:56,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:30:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 03:30:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:30:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:30:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:30:57,123 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:30:57,580 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 03:30:57,580 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 03:30:57,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:30:57,980 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:30:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:57 BoogieIcfgContainer [2019-10-15 03:30:57,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:30:57,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:30:57,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:30:57,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:30:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:56" (1/3) ... [2019-10-15 03:30:57,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54640aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:57, skipping insertion in model container [2019-10-15 03:30:57,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:56" (2/3) ... [2019-10-15 03:30:57,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54640aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:57, skipping insertion in model container [2019-10-15 03:30:57,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:57" (3/3) ... [2019-10-15 03:30:57,989 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-2.c [2019-10-15 03:30:58,001 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:30:58,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:30:58,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:30:58,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:30:58,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:30:58,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:30:58,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:30:58,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:30:58,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:30:58,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:30:58,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:30:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 03:30:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:30:58,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,079 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:58,080 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1309660893, now seen corresponding path program 1 times [2019-10-15 03:30:58,096 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747165934] [2019-10-15 03:30:58,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,341 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:58,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747165934] [2019-10-15 03:30:58,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:58,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:58,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484789916] [2019-10-15 03:30:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:58,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:58,365 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-10-15 03:30:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:58,731 INFO L93 Difference]: Finished difference Result 212 states and 355 transitions. [2019-10-15 03:30:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:58,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:30:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:58,750 INFO L225 Difference]: With dead ends: 212 [2019-10-15 03:30:58,750 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 03:30:58,757 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:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 03:30:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-10-15 03:30:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 03:30:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2019-10-15 03:30:58,814 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 25 [2019-10-15 03:30:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:58,814 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2019-10-15 03:30:58,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2019-10-15 03:30:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:30:58,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,816 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:58,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1949467789, now seen corresponding path program 1 times [2019-10-15 03:30:58,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986019728] [2019-10-15 03:30:58,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,945 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:58,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986019728] [2019-10-15 03:30:58,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:58,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:58,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208797448] [2019-10-15 03:30:58,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:58,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:58,950 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand 5 states. [2019-10-15 03:30:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:59,175 INFO L93 Difference]: Finished difference Result 238 states and 362 transitions. [2019-10-15 03:30:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:59,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:30:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:59,178 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:30:59,178 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 03:30:59,180 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:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 03:30:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2019-10-15 03:30:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-15 03:30:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2019-10-15 03:30:59,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 26 [2019-10-15 03:30:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:59,211 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2019-10-15 03:30:59,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2019-10-15 03:30:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:30:59,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:59,215 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:59,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -979646552, now seen corresponding path program 1 times [2019-10-15 03:30:59,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:59,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755078565] [2019-10-15 03:30:59,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:59,356 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:59,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755078565] [2019-10-15 03:30:59,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:59,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:59,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622454310] [2019-10-15 03:30:59,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:59,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:59,362 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand 5 states. [2019-10-15 03:30:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:59,584 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2019-10-15 03:30:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:59,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:30:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:59,587 INFO L225 Difference]: With dead ends: 276 [2019-10-15 03:30:59,587 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:59,588 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:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-10-15 03:30:59,603 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 43 [2019-10-15 03:30:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:59,603 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-10-15 03:30:59,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-10-15 03:30:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:30:59,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:59,608 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:59,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2026732904, now seen corresponding path program 1 times [2019-10-15 03:30:59,609 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:59,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061183210] [2019-10-15 03:30:59,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:59,709 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:59,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061183210] [2019-10-15 03:30:59,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:59,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:59,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70891848] [2019-10-15 03:30:59,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:59,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:59,712 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 5 states. [2019-10-15 03:30:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:59,909 INFO L93 Difference]: Finished difference Result 295 states and 461 transitions. [2019-10-15 03:30:59,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:59,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:30:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:59,911 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:30:59,911 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:59,913 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:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-10-15 03:30:59,924 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 44 [2019-10-15 03:30:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:59,924 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-10-15 03:30:59,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-10-15 03:30:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:30:59,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:59,931 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:59,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1558077918, now seen corresponding path program 1 times [2019-10-15 03:30:59,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:59,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750764613] [2019-10-15 03:30:59,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:00,032 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:31:00,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750764613] [2019-10-15 03:31:00,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:00,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:00,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217814736] [2019-10-15 03:31:00,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:00,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:00,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:00,035 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 5 states. [2019-10-15 03:31:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:00,209 INFO L93 Difference]: Finished difference Result 314 states and 490 transitions. [2019-10-15 03:31:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:00,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:31:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:00,211 INFO L225 Difference]: With dead ends: 314 [2019-10-15 03:31:00,212 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:31:00,213 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:31:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:31:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:31:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:31:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2019-10-15 03:31:00,223 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 59 [2019-10-15 03:31:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:00,224 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2019-10-15 03:31:00,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2019-10-15 03:31:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:31:00,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:00,226 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:31:00,226 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash -901074578, now seen corresponding path program 1 times [2019-10-15 03:31:00,227 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:00,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965937858] [2019-10-15 03:31:00,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:00,301 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:31:00,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965937858] [2019-10-15 03:31:00,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:00,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:00,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228549272] [2019-10-15 03:31:00,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:00,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:00,306 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand 5 states. [2019-10-15 03:31:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:00,477 INFO L93 Difference]: Finished difference Result 331 states and 514 transitions. [2019-10-15 03:31:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:00,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:31:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:00,479 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:31:00,479 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:31:00,483 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:31:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:31:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:31:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:31:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2019-10-15 03:31:00,501 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 60 [2019-10-15 03:31:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:00,501 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2019-10-15 03:31:00,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2019-10-15 03:31:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:31:00,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:00,503 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:31:00,504 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1631946930, now seen corresponding path program 1 times [2019-10-15 03:31:00,510 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:00,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257986616] [2019-10-15 03:31:00,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:00,615 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:31:00,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257986616] [2019-10-15 03:31:00,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:00,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:00,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585871681] [2019-10-15 03:31:00,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:00,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:00,618 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand 5 states. [2019-10-15 03:31:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:00,866 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2019-10-15 03:31:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:00,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:31:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:00,868 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:31:00,870 INFO L226 Difference]: Without dead ends: 205 [2019-10-15 03:31:00,871 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:31:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-15 03:31:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-15 03:31:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:31:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2019-10-15 03:31:00,884 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 62 [2019-10-15 03:31:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:00,885 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2019-10-15 03:31:00,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2019-10-15 03:31:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:31:00,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:00,886 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:31:00,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash -344124922, now seen corresponding path program 1 times [2019-10-15 03:31:00,887 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:00,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391042984] [2019-10-15 03:31:00,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:00,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:00,952 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:31:00,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391042984] [2019-10-15 03:31:00,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:00,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:00,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545834024] [2019-10-15 03:31:00,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:00,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:00,954 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand 5 states. [2019-10-15 03:31:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:01,194 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2019-10-15 03:31:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:01,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:31:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:01,196 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:31:01,196 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:31:01,196 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:31:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:31:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:31:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:31:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2019-10-15 03:31:01,208 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 72 [2019-10-15 03:31:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:01,209 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2019-10-15 03:31:01,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2019-10-15 03:31:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:31:01,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:01,211 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:31:01,211 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1456817110, now seen corresponding path program 1 times [2019-10-15 03:31:01,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:01,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966388775] [2019-10-15 03:31:01,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:01,272 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:31:01,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966388775] [2019-10-15 03:31:01,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:01,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:01,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193833231] [2019-10-15 03:31:01,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:01,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:01,276 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand 5 states. [2019-10-15 03:31:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:01,447 INFO L93 Difference]: Finished difference Result 435 states and 677 transitions. [2019-10-15 03:31:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:01,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:31:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:01,449 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:31:01,449 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:31:01,450 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:31:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:31:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:31:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:31:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-10-15 03:31:01,460 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 73 [2019-10-15 03:31:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:01,461 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-10-15 03:31:01,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-10-15 03:31:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:31:01,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:01,462 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:31:01,463 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash 164906511, now seen corresponding path program 1 times [2019-10-15 03:31:01,463 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:01,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212144394] [2019-10-15 03:31:01,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:01,514 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:31:01,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212144394] [2019-10-15 03:31:01,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:01,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:01,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200041672] [2019-10-15 03:31:01,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:01,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:01,517 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 5 states. [2019-10-15 03:31:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:01,678 INFO L93 Difference]: Finished difference Result 448 states and 689 transitions. [2019-10-15 03:31:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:01,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 03:31:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:01,680 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:31:01,680 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:31:01,681 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:31:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:31:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:31:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:31:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2019-10-15 03:31:01,692 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 83 [2019-10-15 03:31:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:01,692 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2019-10-15 03:31:01,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2019-10-15 03:31:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:31:01,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:01,694 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:31:01,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash 331093727, now seen corresponding path program 1 times [2019-10-15 03:31:01,695 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:01,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901644654] [2019-10-15 03:31:01,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:01,735 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:31:01,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901644654] [2019-10-15 03:31:01,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:01,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:01,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661148229] [2019-10-15 03:31:01,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:01,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:01,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:01,737 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand 5 states. [2019-10-15 03:31:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:01,897 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-10-15 03:31:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:01,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 03:31:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:01,899 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:31:01,899 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:31:01,900 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:31:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:31:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:31:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:31:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 346 transitions. [2019-10-15 03:31:01,913 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 346 transitions. Word has length 84 [2019-10-15 03:31:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:01,913 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 346 transitions. [2019-10-15 03:31:01,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 346 transitions. [2019-10-15 03:31:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:31:01,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:01,915 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:31:01,915 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash -918567538, now seen corresponding path program 1 times [2019-10-15 03:31:01,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:01,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439337064] [2019-10-15 03:31:01,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:02,013 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:31:02,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439337064] [2019-10-15 03:31:02,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671474961] [2019-10-15 03:31:02,014 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:31:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:02,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:31:02,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:02,165 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:31:02,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:02,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-15 03:31:02,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757849571] [2019-10-15 03:31:02,290 INFO L162 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-10-15 03:31:02,290 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:31:02,297 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:31:02,305 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:31:02,306 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:31:02,381 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:31:02,397 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_connect with input of size 3 for LOIs [2019-10-15 03:31:04,499 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 211 [2019-10-15 03:31:08,002 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 199 [2019-10-15 03:31:11,865 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 211 [2019-10-15 03:31:11,973 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 211 [2019-10-15 03:31:12,322 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 206 [2019-10-15 03:31:25,744 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 242