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_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:31,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:31,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:31,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:31,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:31,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:31,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:31,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:31,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:31,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:31,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:31,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:31,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:31,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:31,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:31,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:31,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:31,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:31,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:31,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:31,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:31,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:31,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:31,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:31,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:31,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:31,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:31,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:31,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:31,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:31,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:31,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:31,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:31,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:31,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:31,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:31,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:31,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:31,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:31,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:31,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:31,746 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:31,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:31,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:31,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:31,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:31,762 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:31,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:31,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:31,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:31,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:31,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:31,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:31,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:31,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:31,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:31,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:31,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:31,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:31,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:31,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:31,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:31,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:31,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:31,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:31,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:31,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:31,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:31,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:31,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:31,767 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:32,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:32,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:32,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:32,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:32,126 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:32,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-1.c [2019-10-15 03:30:32,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815aabd49/364c1911535844e297c115282871c218/FLAGf914c9ec1 [2019-10-15 03:30:32,751 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:32,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-1.c [2019-10-15 03:30:32,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815aabd49/364c1911535844e297c115282871c218/FLAGf914c9ec1 [2019-10-15 03:30:33,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815aabd49/364c1911535844e297c115282871c218 [2019-10-15 03:30:33,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:33,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:33,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:33,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:33,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:33,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:33" (1/1) ... [2019-10-15 03:30:33,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f11b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:33, skipping insertion in model container [2019-10-15 03:30:33,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:33" (1/1) ... [2019-10-15 03:30:33,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:33,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:30:33,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:33,400 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:30:33,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:33,584 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:30:33,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:33 WrapperNode [2019-10-15 03:30:33,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:33,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:30:33,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:30:33,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:30:33,596 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:33" (1/1) ... [2019-10-15 03:30:33,596 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:33" (1/1) ... [2019-10-15 03:30:33,609 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:33" (1/1) ... [2019-10-15 03:30:33,609 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:33" (1/1) ... [2019-10-15 03:30:33,627 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:33" (1/1) ... [2019-10-15 03:30:33,646 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:33" (1/1) ... [2019-10-15 03:30:33,648 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:33" (1/1) ... [2019-10-15 03:30:33,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:30:33,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:30:33,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:30:33,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:30:33,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:33" (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:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:30:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:30:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 03:30:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:30:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:30:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:30:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:30:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:30:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:30:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 03:30:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:30:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:30:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:30:33,870 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:30:34,488 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 03:30:34,489 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 03:30:34,898 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:30:34,899 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:30:34,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:34 BoogieIcfgContainer [2019-10-15 03:30:34,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:30:34,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:30:34,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:30:34,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:30:34,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:33" (1/3) ... [2019-10-15 03:30:34,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b614b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:34, skipping insertion in model container [2019-10-15 03:30:34,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:33" (2/3) ... [2019-10-15 03:30:34,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b614b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:34, skipping insertion in model container [2019-10-15 03:30:34,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:34" (3/3) ... [2019-10-15 03:30:34,910 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-1.c [2019-10-15 03:30:34,920 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:30:34,929 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:30:34,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:30:34,974 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:30:34,974 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:30:34,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:30:34,975 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:30:34,975 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:30:34,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:30:34,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:30:34,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:30:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 03:30:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:30:35,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:35,010 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:35,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1309660893, now seen corresponding path program 1 times [2019-10-15 03:30:35,033 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:35,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422211701] [2019-10-15 03:30:35,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:35,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:35,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:35,349 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:35,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422211701] [2019-10-15 03:30:35,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:35,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:35,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618132516] [2019-10-15 03:30:35,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:35,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:35,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:35,376 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-10-15 03:30:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:35,687 INFO L93 Difference]: Finished difference Result 212 states and 355 transitions. [2019-10-15 03:30:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:35,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:30:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:35,705 INFO L225 Difference]: With dead ends: 212 [2019-10-15 03:30:35,705 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 03:30:35,710 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:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 03:30:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-10-15 03:30:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 03:30:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2019-10-15 03:30:35,774 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 25 [2019-10-15 03:30:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:35,775 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2019-10-15 03:30:35,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2019-10-15 03:30:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:30:35,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:35,777 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:35,777 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:35,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1949467789, now seen corresponding path program 1 times [2019-10-15 03:30:35,778 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:35,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092300871] [2019-10-15 03:30:35,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:35,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:35,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:35,916 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:35,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092300871] [2019-10-15 03:30:35,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:35,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:35,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841253736] [2019-10-15 03:30:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:35,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:35,921 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand 5 states. [2019-10-15 03:30:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:36,168 INFO L93 Difference]: Finished difference Result 238 states and 362 transitions. [2019-10-15 03:30:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:36,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:30:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:36,172 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:30:36,173 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 03:30:36,177 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:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 03:30:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2019-10-15 03:30:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-15 03:30:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2019-10-15 03:30:36,214 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 26 [2019-10-15 03:30:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:36,216 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2019-10-15 03:30:36,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2019-10-15 03:30:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:30:36,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:36,220 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:36,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 825791782, now seen corresponding path program 1 times [2019-10-15 03:30:36,222 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:36,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419984556] [2019-10-15 03:30:36,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:36,358 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:36,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419984556] [2019-10-15 03:30:36,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:36,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:36,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957241787] [2019-10-15 03:30:36,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:36,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:36,365 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand 5 states. [2019-10-15 03:30:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:36,602 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2019-10-15 03:30:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:36,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:30:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:36,606 INFO L225 Difference]: With dead ends: 276 [2019-10-15 03:30:36,607 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:36,608 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:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-10-15 03:30:36,621 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 43 [2019-10-15 03:30:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:36,622 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-10-15 03:30:36,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-10-15 03:30:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:30:36,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:36,624 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:36,625 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash -221294570, now seen corresponding path program 1 times [2019-10-15 03:30:36,625 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:36,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997262159] [2019-10-15 03:30:36,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:36,704 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:36,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997262159] [2019-10-15 03:30:36,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:36,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:36,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842890548] [2019-10-15 03:30:36,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:36,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:36,707 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 5 states. [2019-10-15 03:30:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:36,922 INFO L93 Difference]: Finished difference Result 295 states and 461 transitions. [2019-10-15 03:30:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:36,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:30:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:36,925 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:30:36,925 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:36,931 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:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-10-15 03:30:36,953 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 44 [2019-10-15 03:30:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:36,954 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-10-15 03:30:36,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-10-15 03:30:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:30:36,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:36,960 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:36,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 993114812, now seen corresponding path program 1 times [2019-10-15 03:30:36,961 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:36,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307684036] [2019-10-15 03:30:36,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,030 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:37,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307684036] [2019-10-15 03:30:37,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506440890] [2019-10-15 03:30:37,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,033 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 5 states. [2019-10-15 03:30:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:37,231 INFO L93 Difference]: Finished difference Result 314 states and 490 transitions. [2019-10-15 03:30:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:37,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:30:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:37,233 INFO L225 Difference]: With dead ends: 314 [2019-10-15 03:30:37,233 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:37,234 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:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2019-10-15 03:30:37,246 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 59 [2019-10-15 03:30:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:37,246 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2019-10-15 03:30:37,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2019-10-15 03:30:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:30:37,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:37,249 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:37,249 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1466037684, now seen corresponding path program 1 times [2019-10-15 03:30:37,250 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:37,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38253091] [2019-10-15 03:30:37,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,334 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:37,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38253091] [2019-10-15 03:30:37,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147234975] [2019-10-15 03:30:37,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,338 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand 5 states. [2019-10-15 03:30:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:37,548 INFO L93 Difference]: Finished difference Result 331 states and 514 transitions. [2019-10-15 03:30:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:37,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:30:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:37,550 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:30:37,550 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:37,551 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:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2019-10-15 03:30:37,561 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 60 [2019-10-15 03:30:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:37,562 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2019-10-15 03:30:37,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2019-10-15 03:30:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:30:37,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:37,564 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:37,564 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1631946930, now seen corresponding path program 1 times [2019-10-15 03:30:37,565 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:37,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914686867] [2019-10-15 03:30:37,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,626 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:37,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914686867] [2019-10-15 03:30:37,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211210713] [2019-10-15 03:30:37,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,629 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand 5 states. [2019-10-15 03:30:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:37,842 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2019-10-15 03:30:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:37,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:30:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:37,846 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:30:37,846 INFO L226 Difference]: Without dead ends: 205 [2019-10-15 03:30:37,848 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:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-15 03:30:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-15 03:30:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:30:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2019-10-15 03:30:37,862 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 62 [2019-10-15 03:30:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:37,863 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2019-10-15 03:30:37,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2019-10-15 03:30:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:30:37,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:37,864 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:37,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:37,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1138165896, now seen corresponding path program 1 times [2019-10-15 03:30:37,865 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:37,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046180665] [2019-10-15 03:30:37,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,916 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:37,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046180665] [2019-10-15 03:30:37,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909436975] [2019-10-15 03:30:37,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,918 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand 5 states. [2019-10-15 03:30:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,088 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2019-10-15 03:30:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:30:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,091 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:30:38,091 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:38,092 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:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2019-10-15 03:30:38,116 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 72 [2019-10-15 03:30:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,117 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2019-10-15 03:30:38,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2019-10-15 03:30:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:30:38,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,118 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:38,119 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1355859368, now seen corresponding path program 1 times [2019-10-15 03:30:38,119 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349047248] [2019-10-15 03:30:38,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,176 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:38,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349047248] [2019-10-15 03:30:38,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143223094] [2019-10-15 03:30:38,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,180 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand 5 states. [2019-10-15 03:30:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,338 INFO L93 Difference]: Finished difference Result 435 states and 677 transitions. [2019-10-15 03:30:38,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:30:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,341 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:30:38,341 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:38,342 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:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-10-15 03:30:38,352 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 73 [2019-10-15 03:30:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,353 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-10-15 03:30:38,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-10-15 03:30:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:30:38,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,354 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:38,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1532506952, now seen corresponding path program 1 times [2019-10-15 03:30:38,355 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535370042] [2019-10-15 03:30:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,417 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:38,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535370042] [2019-10-15 03:30:38,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852198850] [2019-10-15 03:30:38,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,420 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 5 states. [2019-10-15 03:30:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,575 INFO L93 Difference]: Finished difference Result 448 states and 689 transitions. [2019-10-15 03:30:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 03:30:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,577 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:30:38,578 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:38,578 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:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2019-10-15 03:30:38,591 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 83 [2019-10-15 03:30:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2019-10-15 03:30:38,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2019-10-15 03:30:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:30:38,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,593 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:38,594 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1366319736, now seen corresponding path program 1 times [2019-10-15 03:30:38,594 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645348226] [2019-10-15 03:30:38,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,664 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:38,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645348226] [2019-10-15 03:30:38,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984220882] [2019-10-15 03:30:38,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,667 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand 5 states. [2019-10-15 03:30:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,848 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-10-15 03:30:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 03:30:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,850 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:30:38,850 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:38,851 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:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 346 transitions. [2019-10-15 03:30:38,863 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 346 transitions. Word has length 84 [2019-10-15 03:30:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,864 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 346 transitions. [2019-10-15 03:30:38,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 346 transitions. [2019-10-15 03:30:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:30:38,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,866 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:38,866 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1678986295, now seen corresponding path program 1 times [2019-10-15 03:30:38,867 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284126480] [2019-10-15 03:30:38,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,997 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:38,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284126480] [2019-10-15 03:30:38,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919740123] [2019-10-15 03:30:38,998 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:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:39,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:30:39,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:30:39,166 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:39,167 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:30:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:39,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 33 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-15 03:30:39,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382494805] [2019-10-15 03:30:39,366 INFO L162 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-10-15 03:30:39,366 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:30:39,373 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:30:39,388 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:30:39,389 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:30:39,465 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:30:39,478 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_connect with input of size 3 for LOIs [2019-10-15 03:30:42,723 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 232 [2019-10-15 03:30:42,886 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-10-15 03:30:45,965 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 223 [2019-10-15 03:30:46,201 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 237 [2019-10-15 03:30:47,863 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 227 [2019-10-15 03:30:48,216 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 215