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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:33,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:33,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:33,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:33,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:33,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:33,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:33,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:33,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:33,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:33,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:33,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:33,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:33,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:33,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:33,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:33,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:33,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:33,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:33,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:33,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:33,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:33,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:33,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:33,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:33,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:33,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:33,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:33,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:33,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:33,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:33,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:33,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:33,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:33,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:33,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:33,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:33,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:33,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:33,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:33,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:33,819 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:33,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:33,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:33,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:33,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:33,835 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:33,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:33,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:33,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:33,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:33,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:33,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:33,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:33,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:33,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:33,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:33,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:33,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:33,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:33,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:33,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:33,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:33,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:33,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:33,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:33,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:33,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:33,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:33,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:33,839 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:34,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:34,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:34,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:34,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:34,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:34,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-15 03:30:34,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc3b7d4d/dc081bf6c2a7464e81a9619db714b6b5/FLAGb88eb995a [2019-10-15 03:30:34,780 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:34,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-15 03:30:34,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc3b7d4d/dc081bf6c2a7464e81a9619db714b6b5/FLAGb88eb995a [2019-10-15 03:30:35,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc3b7d4d/dc081bf6c2a7464e81a9619db714b6b5 [2019-10-15 03:30:35,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:35,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:35,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:35,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:35,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:35,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:35" (1/1) ... [2019-10-15 03:30:35,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f2c82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:35, skipping insertion in model container [2019-10-15 03:30:35,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:35" (1/1) ... [2019-10-15 03:30:35,112 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:35,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:30:35,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:35,410 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:30:35,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:35,577 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:30:35,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:35 WrapperNode [2019-10-15 03:30:35,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:35,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:30:35,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:30:35,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:30:35,593 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:35" (1/1) ... [2019-10-15 03:30:35,594 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:35" (1/1) ... [2019-10-15 03:30:35,605 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:35" (1/1) ... [2019-10-15 03:30:35,606 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:35" (1/1) ... [2019-10-15 03:30:35,626 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:35" (1/1) ... [2019-10-15 03:30:35,639 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:35" (1/1) ... [2019-10-15 03:30:35,642 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:35" (1/1) ... [2019-10-15 03:30:35,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:30:35,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:30:35,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:30:35,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:30:35,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:35" (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:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:30:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:30:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 03:30:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:30:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:30:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:30:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:30:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:30:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:30:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 03:30:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:30:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:30:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:30:35,873 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:30:36,402 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 03:30:36,403 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 03:30:36,835 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:30:36,835 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:30:36,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:36 BoogieIcfgContainer [2019-10-15 03:30:36,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:30:36,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:30:36,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:30:36,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:30:36,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:35" (1/3) ... [2019-10-15 03:30:36,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650777e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:36, skipping insertion in model container [2019-10-15 03:30:36,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:35" (2/3) ... [2019-10-15 03:30:36,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650777e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:36, skipping insertion in model container [2019-10-15 03:30:36,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:36" (3/3) ... [2019-10-15 03:30:36,846 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-15 03:30:36,857 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:30:36,865 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:30:36,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:30:36,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:30:36,905 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:30:36,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:30:36,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:30:36,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:30:36,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:30:36,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:30:36,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:30:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 03:30:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:30:36,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:36,939 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:36,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1309660893, now seen corresponding path program 1 times [2019-10-15 03:30:36,958 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:36,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371241449] [2019-10-15 03:30:36,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:36,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,264 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:37,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371241449] [2019-10-15 03:30:37,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281409391] [2019-10-15 03:30:37,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,288 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-10-15 03:30:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:37,613 INFO L93 Difference]: Finished difference Result 212 states and 355 transitions. [2019-10-15 03:30:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:37,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:30:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:37,631 INFO L225 Difference]: With dead ends: 212 [2019-10-15 03:30:37,631 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 03:30:37,635 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,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 03:30:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-10-15 03:30:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 03:30:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2019-10-15 03:30:37,701 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 25 [2019-10-15 03:30:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:37,702 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2019-10-15 03:30:37,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2019-10-15 03:30:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:30:37,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:37,704 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:37,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1949467789, now seen corresponding path program 1 times [2019-10-15 03:30:37,705 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:37,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171415494] [2019-10-15 03:30:37,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:37,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:37,841 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:37,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171415494] [2019-10-15 03:30:37,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:37,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:37,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309096236] [2019-10-15 03:30:37,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:37,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:37,845 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand 5 states. [2019-10-15 03:30:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,105 INFO L93 Difference]: Finished difference Result 238 states and 362 transitions. [2019-10-15 03:30:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:30:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,108 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:30:38,108 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 03:30:38,110 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,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 03:30:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2019-10-15 03:30:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-15 03:30:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2019-10-15 03:30:38,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 26 [2019-10-15 03:30:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,126 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2019-10-15 03:30:38,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2019-10-15 03:30:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:30:38,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,129 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:38,129 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash 825791782, now seen corresponding path program 1 times [2019-10-15 03:30:38,130 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069427941] [2019-10-15 03:30:38,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,262 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:38,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069427941] [2019-10-15 03:30:38,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189365226] [2019-10-15 03:30:38,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,267 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand 5 states. [2019-10-15 03:30:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,500 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2019-10-15 03:30:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:30:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,504 INFO L225 Difference]: With dead ends: 276 [2019-10-15 03:30:38,504 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:38,508 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,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-10-15 03:30:38,529 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 43 [2019-10-15 03:30:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,530 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-10-15 03:30:38,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-10-15 03:30:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:30:38,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,534 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:38,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash -221294570, now seen corresponding path program 1 times [2019-10-15 03:30:38,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341157857] [2019-10-15 03:30:38,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,644 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:38,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341157857] [2019-10-15 03:30:38,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116760121] [2019-10-15 03:30:38,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,646 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 5 states. [2019-10-15 03:30:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:38,853 INFO L93 Difference]: Finished difference Result 295 states and 461 transitions. [2019-10-15 03:30:38,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:38,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:30:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:38,856 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:30:38,856 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:38,857 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,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-10-15 03:30:38,870 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 44 [2019-10-15 03:30:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:38,871 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-10-15 03:30:38,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-10-15 03:30:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:30:38,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:38,874 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:38,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash 993114812, now seen corresponding path program 1 times [2019-10-15 03:30:38,875 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:38,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612721950] [2019-10-15 03:30:38,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:38,932 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:38,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612721950] [2019-10-15 03:30:38,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:38,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:38,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128023439] [2019-10-15 03:30:38,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:38,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:38,935 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 5 states. [2019-10-15 03:30:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:39,120 INFO L93 Difference]: Finished difference Result 314 states and 490 transitions. [2019-10-15 03:30:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:39,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:30:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:39,122 INFO L225 Difference]: With dead ends: 314 [2019-10-15 03:30:39,123 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:39,124 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:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2019-10-15 03:30:39,137 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 59 [2019-10-15 03:30:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:39,137 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2019-10-15 03:30:39,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2019-10-15 03:30:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:30:39,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:39,140 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:39,140 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1466037684, now seen corresponding path program 1 times [2019-10-15 03:30:39,141 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:39,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728704754] [2019-10-15 03:30:39,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:39,191 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:39,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728704754] [2019-10-15 03:30:39,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:39,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:39,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930881] [2019-10-15 03:30:39,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:39,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:39,193 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand 5 states. [2019-10-15 03:30:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:39,386 INFO L93 Difference]: Finished difference Result 331 states and 514 transitions. [2019-10-15 03:30:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:39,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:30:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:39,388 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:30:39,388 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:39,389 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:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2019-10-15 03:30:39,400 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 60 [2019-10-15 03:30:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:39,400 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2019-10-15 03:30:39,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2019-10-15 03:30:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:30:39,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:39,403 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:39,403 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1631946930, now seen corresponding path program 1 times [2019-10-15 03:30:39,404 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:39,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909263483] [2019-10-15 03:30:39,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:39,470 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:39,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909263483] [2019-10-15 03:30:39,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:39,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:39,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657471513] [2019-10-15 03:30:39,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:39,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:39,473 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand 5 states. [2019-10-15 03:30:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:39,693 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2019-10-15 03:30:39,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:39,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:30:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:39,695 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:30:39,695 INFO L226 Difference]: Without dead ends: 205 [2019-10-15 03:30:39,696 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:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-15 03:30:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-15 03:30:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:30:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2019-10-15 03:30:39,708 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 62 [2019-10-15 03:30:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:39,708 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2019-10-15 03:30:39,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2019-10-15 03:30:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:30:39,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:39,711 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:39,711 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1138165896, now seen corresponding path program 1 times [2019-10-15 03:30:39,712 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:39,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639122819] [2019-10-15 03:30:39,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:39,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:39,789 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:39,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639122819] [2019-10-15 03:30:39,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:39,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:39,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581901154] [2019-10-15 03:30:39,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:39,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:39,793 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand 5 states. [2019-10-15 03:30:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:39,999 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2019-10-15 03:30:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:40,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:30:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:40,001 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:30:40,002 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:40,002 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:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2019-10-15 03:30:40,014 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 72 [2019-10-15 03:30:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:40,014 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2019-10-15 03:30:40,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2019-10-15 03:30:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:30:40,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:40,016 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:40,016 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1355859368, now seen corresponding path program 1 times [2019-10-15 03:30:40,017 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:40,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697838676] [2019-10-15 03:30:40,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:40,062 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:40,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697838676] [2019-10-15 03:30:40,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:40,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:40,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446058851] [2019-10-15 03:30:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:40,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:40,065 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand 5 states. [2019-10-15 03:30:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:40,254 INFO L93 Difference]: Finished difference Result 435 states and 677 transitions. [2019-10-15 03:30:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:40,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:30:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:40,257 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:30:40,257 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:40,258 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:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-10-15 03:30:40,269 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 73 [2019-10-15 03:30:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:40,270 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-10-15 03:30:40,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-10-15 03:30:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:30:40,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:40,271 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:40,271 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1532506952, now seen corresponding path program 1 times [2019-10-15 03:30:40,272 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:40,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840503745] [2019-10-15 03:30:40,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:40,335 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:40,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840503745] [2019-10-15 03:30:40,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:40,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:40,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880392030] [2019-10-15 03:30:40,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:40,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:40,338 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 5 states. [2019-10-15 03:30:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:40,574 INFO L93 Difference]: Finished difference Result 448 states and 689 transitions. [2019-10-15 03:30:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:40,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 03:30:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:40,576 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:30:40,576 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:40,577 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:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2019-10-15 03:30:40,590 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 83 [2019-10-15 03:30:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:40,591 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2019-10-15 03:30:40,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2019-10-15 03:30:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:30:40,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:40,592 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:40,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1366319736, now seen corresponding path program 1 times [2019-10-15 03:30:40,593 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:40,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709077688] [2019-10-15 03:30:40,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:40,635 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:40,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709077688] [2019-10-15 03:30:40,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:40,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:40,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300859123] [2019-10-15 03:30:40,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:40,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:40,637 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand 5 states. [2019-10-15 03:30:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:40,790 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-10-15 03:30:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:40,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 03:30:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:40,793 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:30:40,793 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:40,794 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:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 346 transitions. [2019-10-15 03:30:40,808 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 346 transitions. Word has length 84 [2019-10-15 03:30:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:40,808 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 346 transitions. [2019-10-15 03:30:40,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 346 transitions. [2019-10-15 03:30:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:30:40,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:40,810 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:40,810 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1678986295, now seen corresponding path program 1 times [2019-10-15 03:30:40,811 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:40,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461500234] [2019-10-15 03:30:40,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:40,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:40,891 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:40,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461500234] [2019-10-15 03:30:40,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951393021] [2019-10-15 03:30:40,892 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:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:40,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:30:40,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:30:41,032 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:41,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:30:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-15 03:30:41,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427094663] [2019-10-15 03:30:41,140 INFO L162 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-10-15 03:30:41,141 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:30:41,147 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:30:41,159 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:30:41,160 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:30:41,214 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:30:41,227 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_connect with input of size 3 for LOIs [2019-10-15 03:30:43,943 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 221 [2019-10-15 03:30:44,316 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-15 03:30:44,452 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:44,650 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-10-15 03:30:45,027 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 225 [2019-10-15 03:30:45,791 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-10-15 03:30:48,507 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 227 [2019-10-15 03:30:49,057 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 234 [2019-10-15 03:30:49,189 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2019-10-15 03:30:51,359 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 200