/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:45,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:45,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:45,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:45,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:45,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:45,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:45,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:45,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:45,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:45,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:45,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:45,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:45,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:45,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:45,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:45,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:45,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:45,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:45,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:45,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:45,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:45,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:45,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:45,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:45,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:45,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:45,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:45,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:45,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:45,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:45,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:45,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:45,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:45,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:45,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:45,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:45,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:45,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:45,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:45,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:45,323 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-11-07 01:13:45,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:45,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:45,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:45,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:45,339 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:45,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:45,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:45,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:45,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:45,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:45,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:45,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:45,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:45,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:45,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:45,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:45,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:45,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:45,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:45,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:45,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:45,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:45,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:45,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:45,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:45,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:45,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:45,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:45,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:13:45,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:45,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:45,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:45,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:45,636 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:45,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-07 01:13:45,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc84ce63/c959455a22b54a2686d4011d4ea784bf/FLAGdbea057d6 [2019-11-07 01:13:46,226 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:46,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-07 01:13:46,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc84ce63/c959455a22b54a2686d4011d4ea784bf/FLAGdbea057d6 [2019-11-07 01:13:46,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc84ce63/c959455a22b54a2686d4011d4ea784bf [2019-11-07 01:13:46,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:46,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:46,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:46,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:46,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:46,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:46" (1/1) ... [2019-11-07 01:13:46,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c1958d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:46, skipping insertion in model container [2019-11-07 01:13:46,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:46" (1/1) ... [2019-11-07 01:13:46,555 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:46,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:46,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:46,889 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:47,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:47,066 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:47,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47 WrapperNode [2019-11-07 01:13:47,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:47,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:47,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:47,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:47,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (1/1) ... [2019-11-07 01:13:47,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:47,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:47,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:47,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:47,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (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-11-07 01:13:47,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:47,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-07 01:13:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:13:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:13:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:13:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-07 01:13:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:47,443 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:13:48,090 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-07 01:13:48,090 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-07 01:13:48,093 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:48,094 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:48,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:48 BoogieIcfgContainer [2019-11-07 01:13:48,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:48,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:48,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:48,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:48,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:46" (1/3) ... [2019-11-07 01:13:48,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290bbfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:48, skipping insertion in model container [2019-11-07 01:13:48,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:47" (2/3) ... [2019-11-07 01:13:48,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290bbfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:48, skipping insertion in model container [2019-11-07 01:13:48,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:48" (3/3) ... [2019-11-07 01:13:48,105 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-07 01:13:48,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:48,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:48,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:48,164 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:48,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:48,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:48,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:48,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:48,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:48,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:48,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-07 01:13:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 01:13:48,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:48,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:48,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2138433857, now seen corresponding path program 1 times [2019-11-07 01:13:48,218 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:48,219 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362976863] [2019-11-07 01:13:48,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:48,482 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362976863] [2019-11-07 01:13:48,483 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:48,484 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:48,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469680753] [2019-11-07 01:13:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:48,492 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:48,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:48,510 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 5 states. [2019-11-07 01:13:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:48,897 INFO L93 Difference]: Finished difference Result 333 states and 566 transitions. [2019-11-07 01:13:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:48,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-07 01:13:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:48,916 INFO L225 Difference]: With dead ends: 333 [2019-11-07 01:13:48,916 INFO L226 Difference]: Without dead ends: 166 [2019-11-07 01:13:48,921 INFO L630 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-11-07 01:13:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-07 01:13:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-11-07 01:13:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-07 01:13:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2019-11-07 01:13:49,016 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 28 [2019-11-07 01:13:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:49,017 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2019-11-07 01:13:49,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2019-11-07 01:13:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:49,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:49,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:49,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1059341068, now seen corresponding path program 1 times [2019-11-07 01:13:49,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:49,023 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122695708] [2019-11-07 01:13:49,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:49,139 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122695708] [2019-11-07 01:13:49,139 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:49,139 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:49,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402228987] [2019-11-07 01:13:49,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:49,141 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:49,142 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand 5 states. [2019-11-07 01:13:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:49,364 INFO L93 Difference]: Finished difference Result 336 states and 528 transitions. [2019-11-07 01:13:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:49,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-07 01:13:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:49,368 INFO L225 Difference]: With dead ends: 336 [2019-11-07 01:13:49,368 INFO L226 Difference]: Without dead ends: 187 [2019-11-07 01:13:49,370 INFO L630 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-11-07 01:13:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-07 01:13:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-07 01:13:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-07 01:13:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2019-11-07 01:13:49,386 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 29 [2019-11-07 01:13:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:49,386 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2019-11-07 01:13:49,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2019-11-07 01:13:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:49,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:49,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:49,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -947080425, now seen corresponding path program 1 times [2019-11-07 01:13:49,389 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:49,389 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861041007] [2019-11-07 01:13:49,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:49,499 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861041007] [2019-11-07 01:13:49,499 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:49,499 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:49,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451347401] [2019-11-07 01:13:49,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:49,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:49,501 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand 5 states. [2019-11-07 01:13:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:49,744 INFO L93 Difference]: Finished difference Result 367 states and 572 transitions. [2019-11-07 01:13:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:49,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-07 01:13:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:49,747 INFO L225 Difference]: With dead ends: 367 [2019-11-07 01:13:49,747 INFO L226 Difference]: Without dead ends: 195 [2019-11-07 01:13:49,748 INFO L630 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-11-07 01:13:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-07 01:13:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-11-07 01:13:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-07 01:13:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2019-11-07 01:13:49,766 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 29 [2019-11-07 01:13:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:49,766 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2019-11-07 01:13:49,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2019-11-07 01:13:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:49,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:49,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:49,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash 837081432, now seen corresponding path program 1 times [2019-11-07 01:13:49,769 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:49,770 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122074268] [2019-11-07 01:13:49,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:49,876 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122074268] [2019-11-07 01:13:49,876 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:49,876 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:49,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520688904] [2019-11-07 01:13:49,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:49,877 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:49,878 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand 5 states. [2019-11-07 01:13:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:50,128 INFO L93 Difference]: Finished difference Result 372 states and 582 transitions. [2019-11-07 01:13:50,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:50,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-07 01:13:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:50,131 INFO L225 Difference]: With dead ends: 372 [2019-11-07 01:13:50,131 INFO L226 Difference]: Without dead ends: 194 [2019-11-07 01:13:50,132 INFO L630 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-11-07 01:13:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-07 01:13:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-11-07 01:13:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-07 01:13:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 299 transitions. [2019-11-07 01:13:50,167 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 299 transitions. Word has length 29 [2019-11-07 01:13:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:50,167 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 299 transitions. [2019-11-07 01:13:50,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 299 transitions. [2019-11-07 01:13:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 01:13:50,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:50,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:50,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2002433700, now seen corresponding path program 1 times [2019-11-07 01:13:50,171 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:50,172 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859292396] [2019-11-07 01:13:50,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:50,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859292396] [2019-11-07 01:13:50,281 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:50,282 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:50,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410345975] [2019-11-07 01:13:50,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:50,283 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:50,283 INFO L87 Difference]: Start difference. First operand 192 states and 299 transitions. Second operand 5 states. [2019-11-07 01:13:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:50,464 INFO L93 Difference]: Finished difference Result 383 states and 594 transitions. [2019-11-07 01:13:50,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:50,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-07 01:13:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:50,467 INFO L225 Difference]: With dead ends: 383 [2019-11-07 01:13:50,467 INFO L226 Difference]: Without dead ends: 204 [2019-11-07 01:13:50,468 INFO L630 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-11-07 01:13:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-07 01:13:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-07 01:13:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-07 01:13:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 297 transitions. [2019-11-07 01:13:50,479 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 297 transitions. Word has length 30 [2019-11-07 01:13:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:50,480 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 297 transitions. [2019-11-07 01:13:50,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 297 transitions. [2019-11-07 01:13:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 01:13:50,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:50,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:50,482 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 533516532, now seen corresponding path program 1 times [2019-11-07 01:13:50,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:50,483 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892525] [2019-11-07 01:13:50,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:50,531 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892525] [2019-11-07 01:13:50,532 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:50,532 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:50,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79645735] [2019-11-07 01:13:50,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:50,533 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:50,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:50,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:50,534 INFO L87 Difference]: Start difference. First operand 192 states and 297 transitions. Second operand 5 states. [2019-11-07 01:13:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:50,728 INFO L93 Difference]: Finished difference Result 383 states and 590 transitions. [2019-11-07 01:13:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:50,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-07 01:13:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:50,730 INFO L225 Difference]: With dead ends: 383 [2019-11-07 01:13:50,731 INFO L226 Difference]: Without dead ends: 204 [2019-11-07 01:13:50,732 INFO L630 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-11-07 01:13:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-07 01:13:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-07 01:13:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-07 01:13:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2019-11-07 01:13:50,744 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 31 [2019-11-07 01:13:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:50,744 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2019-11-07 01:13:50,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2019-11-07 01:13:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 01:13:50,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:50,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:50,746 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash -714108489, now seen corresponding path program 1 times [2019-11-07 01:13:50,747 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:50,747 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275088194] [2019-11-07 01:13:50,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:50,789 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275088194] [2019-11-07 01:13:50,789 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:50,789 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:50,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410616852] [2019-11-07 01:13:50,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:50,790 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:50,791 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand 5 states. [2019-11-07 01:13:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,001 INFO L93 Difference]: Finished difference Result 383 states and 586 transitions. [2019-11-07 01:13:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:51,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-07 01:13:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,003 INFO L225 Difference]: With dead ends: 383 [2019-11-07 01:13:51,003 INFO L226 Difference]: Without dead ends: 204 [2019-11-07 01:13:51,004 INFO L630 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-11-07 01:13:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-07 01:13:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-07 01:13:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-07 01:13:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2019-11-07 01:13:51,016 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 32 [2019-11-07 01:13:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,016 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-07 01:13:51,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2019-11-07 01:13:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 01:13:51,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash 522773526, now seen corresponding path program 1 times [2019-11-07 01:13:51,019 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,019 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075332762] [2019-11-07 01:13:51,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:51,047 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075332762] [2019-11-07 01:13:51,048 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:51,048 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:51,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455800817] [2019-11-07 01:13:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:51,049 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:51,050 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand 3 states. [2019-11-07 01:13:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,077 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2019-11-07 01:13:51,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:51,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 01:13:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,080 INFO L225 Difference]: With dead ends: 542 [2019-11-07 01:13:51,081 INFO L226 Difference]: Without dead ends: 363 [2019-11-07 01:13:51,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-07 01:13:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-11-07 01:13:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-07 01:13:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-11-07 01:13:51,101 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 32 [2019-11-07 01:13:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,102 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-11-07 01:13:51,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-11-07 01:13:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 01:13:51,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1890290600, now seen corresponding path program 1 times [2019-11-07 01:13:51,104 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,105 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761410291] [2019-11-07 01:13:51,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:51,168 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761410291] [2019-11-07 01:13:51,169 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:51,169 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:13:51,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649980699] [2019-11-07 01:13:51,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:13:51,170 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:13:51,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:13:51,172 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-11-07 01:13:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,355 INFO L93 Difference]: Finished difference Result 437 states and 658 transitions. [2019-11-07 01:13:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:13:51,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-07 01:13:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,359 INFO L225 Difference]: With dead ends: 437 [2019-11-07 01:13:51,360 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 01:13:51,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:13:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 01:13:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 370. [2019-11-07 01:13:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-07 01:13:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2019-11-07 01:13:51,384 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 33 [2019-11-07 01:13:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,387 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2019-11-07 01:13:51,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:13:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2019-11-07 01:13:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 01:13:51,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,389 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -784025939, now seen corresponding path program 1 times [2019-11-07 01:13:51,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,390 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323880318] [2019-11-07 01:13:51,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:51,445 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323880318] [2019-11-07 01:13:51,445 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:51,446 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:51,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106423223] [2019-11-07 01:13:51,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:51,446 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:51,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:51,447 INFO L87 Difference]: Start difference. First operand 370 states and 563 transitions. Second operand 5 states. [2019-11-07 01:13:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,661 INFO L93 Difference]: Finished difference Result 748 states and 1133 transitions. [2019-11-07 01:13:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:51,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-07 01:13:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,665 INFO L225 Difference]: With dead ends: 748 [2019-11-07 01:13:51,666 INFO L226 Difference]: Without dead ends: 392 [2019-11-07 01:13:51,667 INFO L630 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-11-07 01:13:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-07 01:13:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 370. [2019-11-07 01:13:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-07 01:13:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2019-11-07 01:13:51,690 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 34 [2019-11-07 01:13:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,691 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2019-11-07 01:13:51,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2019-11-07 01:13:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 01:13:51,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,693 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash -48568943, now seen corresponding path program 1 times [2019-11-07 01:13:51,693 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378541196] [2019-11-07 01:13:51,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:51,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378541196] [2019-11-07 01:13:51,742 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:51,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:51,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401759335] [2019-11-07 01:13:51,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:51,743 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:51,743 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand 5 states. [2019-11-07 01:13:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,954 INFO L93 Difference]: Finished difference Result 738 states and 1117 transitions. [2019-11-07 01:13:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:51,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-07 01:13:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,957 INFO L225 Difference]: With dead ends: 738 [2019-11-07 01:13:51,958 INFO L226 Difference]: Without dead ends: 382 [2019-11-07 01:13:51,959 INFO L630 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-11-07 01:13:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-07 01:13:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-07 01:13:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-07 01:13:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 565 transitions. [2019-11-07 01:13:51,982 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 565 transitions. Word has length 34 [2019-11-07 01:13:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,983 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 565 transitions. [2019-11-07 01:13:51,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 565 transitions. [2019-11-07 01:13:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 01:13:51,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,984 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,985 INFO L82 PathProgramCache]: Analyzing trace with hash 815405373, now seen corresponding path program 1 times [2019-11-07 01:13:51,985 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,985 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910938992] [2019-11-07 01:13:51,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:52,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910938992] [2019-11-07 01:13:52,026 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:52,026 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:52,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240735300] [2019-11-07 01:13:52,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:52,027 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:52,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:52,027 INFO L87 Difference]: Start difference. First operand 374 states and 565 transitions. Second operand 5 states. [2019-11-07 01:13:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:52,229 INFO L93 Difference]: Finished difference Result 787 states and 1184 transitions. [2019-11-07 01:13:52,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:52,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-07 01:13:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:52,233 INFO L225 Difference]: With dead ends: 787 [2019-11-07 01:13:52,233 INFO L226 Difference]: Without dead ends: 427 [2019-11-07 01:13:52,234 INFO L630 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-11-07 01:13:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-07 01:13:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2019-11-07 01:13:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-07 01:13:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 626 transitions. [2019-11-07 01:13:52,261 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 626 transitions. Word has length 35 [2019-11-07 01:13:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:52,262 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 626 transitions. [2019-11-07 01:13:52,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 626 transitions. [2019-11-07 01:13:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 01:13:52,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:52,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:52,263 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1933074875, now seen corresponding path program 1 times [2019-11-07 01:13:52,264 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:52,264 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919752042] [2019-11-07 01:13:52,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:52,307 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919752042] [2019-11-07 01:13:52,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:52,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:52,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120366806] [2019-11-07 01:13:52,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:52,309 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:52,309 INFO L87 Difference]: Start difference. First operand 419 states and 626 transitions. Second operand 5 states. [2019-11-07 01:13:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:52,551 INFO L93 Difference]: Finished difference Result 883 states and 1316 transitions. [2019-11-07 01:13:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:52,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 01:13:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:52,554 INFO L225 Difference]: With dead ends: 883 [2019-11-07 01:13:52,554 INFO L226 Difference]: Without dead ends: 478 [2019-11-07 01:13:52,555 INFO L630 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-11-07 01:13:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-07 01:13:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2019-11-07 01:13:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-07 01:13:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2019-11-07 01:13:52,580 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 38 [2019-11-07 01:13:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:52,580 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2019-11-07 01:13:52,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2019-11-07 01:13:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 01:13:52,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:52,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:52,582 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1841800743, now seen corresponding path program 1 times [2019-11-07 01:13:52,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:52,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279291711] [2019-11-07 01:13:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:52,626 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279291711] [2019-11-07 01:13:52,626 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:52,626 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:52,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198981290] [2019-11-07 01:13:52,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:52,627 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:52,627 INFO L87 Difference]: Start difference. First operand 468 states and 693 transitions. Second operand 5 states. [2019-11-07 01:13:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:52,822 INFO L93 Difference]: Finished difference Result 987 states and 1456 transitions. [2019-11-07 01:13:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:52,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 01:13:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:52,826 INFO L225 Difference]: With dead ends: 987 [2019-11-07 01:13:52,826 INFO L226 Difference]: Without dead ends: 533 [2019-11-07 01:13:52,828 INFO L630 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-11-07 01:13:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-07 01:13:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 523. [2019-11-07 01:13:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-07 01:13:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 768 transitions. [2019-11-07 01:13:52,856 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 768 transitions. Word has length 38 [2019-11-07 01:13:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:52,857 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 768 transitions. [2019-11-07 01:13:52,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 768 transitions. [2019-11-07 01:13:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 01:13:52,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:52,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:52,859 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:52,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash -416177979, now seen corresponding path program 1 times [2019-11-07 01:13:52,859 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:52,859 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330357733] [2019-11-07 01:13:52,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:52,925 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330357733] [2019-11-07 01:13:52,926 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:52,926 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:52,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799923883] [2019-11-07 01:13:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:52,927 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:52,927 INFO L87 Difference]: Start difference. First operand 523 states and 768 transitions. Second operand 5 states. [2019-11-07 01:13:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:53,148 INFO L93 Difference]: Finished difference Result 1048 states and 1541 transitions. [2019-11-07 01:13:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:53,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-07 01:13:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:53,153 INFO L225 Difference]: With dead ends: 1048 [2019-11-07 01:13:53,153 INFO L226 Difference]: Without dead ends: 539 [2019-11-07 01:13:53,156 INFO L630 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-11-07 01:13:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-07 01:13:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-11-07 01:13:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-07 01:13:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2019-11-07 01:13:53,187 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 39 [2019-11-07 01:13:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:53,188 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2019-11-07 01:13:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2019-11-07 01:13:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 01:13:53,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:53,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:53,190 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash -758043503, now seen corresponding path program 1 times [2019-11-07 01:13:53,191 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:53,191 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407103833] [2019-11-07 01:13:53,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:53,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407103833] [2019-11-07 01:13:53,232 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:53,232 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:53,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167347925] [2019-11-07 01:13:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:53,234 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:53,235 INFO L87 Difference]: Start difference. First operand 529 states and 778 transitions. Second operand 5 states. [2019-11-07 01:13:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:53,456 INFO L93 Difference]: Finished difference Result 1054 states and 1551 transitions. [2019-11-07 01:13:53,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:53,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-07 01:13:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:53,460 INFO L225 Difference]: With dead ends: 1054 [2019-11-07 01:13:53,460 INFO L226 Difference]: Without dead ends: 539 [2019-11-07 01:13:53,461 INFO L630 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-11-07 01:13:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-07 01:13:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-11-07 01:13:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-07 01:13:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 774 transitions. [2019-11-07 01:13:53,488 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 774 transitions. Word has length 39 [2019-11-07 01:13:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:53,488 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 774 transitions. [2019-11-07 01:13:53,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 774 transitions. [2019-11-07 01:13:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 01:13:53,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:53,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:53,489 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash -342748957, now seen corresponding path program 1 times [2019-11-07 01:13:53,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:53,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006371899] [2019-11-07 01:13:53,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:53,541 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006371899] [2019-11-07 01:13:53,542 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:53,542 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:53,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15287564] [2019-11-07 01:13:53,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:53,543 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:53,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:53,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:53,543 INFO L87 Difference]: Start difference. First operand 529 states and 774 transitions. Second operand 5 states. [2019-11-07 01:13:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:53,759 INFO L93 Difference]: Finished difference Result 1121 states and 1638 transitions. [2019-11-07 01:13:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:53,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-07 01:13:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:53,763 INFO L225 Difference]: With dead ends: 1121 [2019-11-07 01:13:53,763 INFO L226 Difference]: Without dead ends: 606 [2019-11-07 01:13:53,764 INFO L630 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-11-07 01:13:53,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-07 01:13:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2019-11-07 01:13:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-11-07 01:13:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 853 transitions. [2019-11-07 01:13:53,795 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 853 transitions. Word has length 40 [2019-11-07 01:13:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:53,795 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 853 transitions. [2019-11-07 01:13:53,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 853 transitions. [2019-11-07 01:13:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:13:53,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:53,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:53,797 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1593154033, now seen corresponding path program 1 times [2019-11-07 01:13:53,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:53,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503800426] [2019-11-07 01:13:53,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:53,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503800426] [2019-11-07 01:13:53,843 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:53,843 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:53,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667206791] [2019-11-07 01:13:53,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:53,844 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:53,845 INFO L87 Difference]: Start difference. First operand 588 states and 853 transitions. Second operand 5 states. [2019-11-07 01:13:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,068 INFO L93 Difference]: Finished difference Result 1188 states and 1731 transitions. [2019-11-07 01:13:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:54,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 01:13:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,072 INFO L225 Difference]: With dead ends: 1188 [2019-11-07 01:13:54,072 INFO L226 Difference]: Without dead ends: 614 [2019-11-07 01:13:54,074 INFO L630 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-11-07 01:13:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-07 01:13:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2019-11-07 01:13:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-07 01:13:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 867 transitions. [2019-11-07 01:13:54,112 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 867 transitions. Word has length 41 [2019-11-07 01:13:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,113 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 867 transitions. [2019-11-07 01:13:54,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 867 transitions. [2019-11-07 01:13:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:13:54,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,115 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash -104670206, now seen corresponding path program 1 times [2019-11-07 01:13:54,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712053371] [2019-11-07 01:13:54,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,168 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712053371] [2019-11-07 01:13:54,168 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,168 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:54,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655714517] [2019-11-07 01:13:54,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:54,170 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:54,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:54,170 INFO L87 Difference]: Start difference. First operand 596 states and 867 transitions. Second operand 5 states. [2019-11-07 01:13:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,400 INFO L93 Difference]: Finished difference Result 1261 states and 1832 transitions. [2019-11-07 01:13:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:54,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-07 01:13:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,404 INFO L225 Difference]: With dead ends: 1261 [2019-11-07 01:13:54,404 INFO L226 Difference]: Without dead ends: 679 [2019-11-07 01:13:54,406 INFO L630 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-11-07 01:13:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-11-07 01:13:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 651. [2019-11-07 01:13:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 01:13:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 936 transitions. [2019-11-07 01:13:54,440 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 936 transitions. Word has length 43 [2019-11-07 01:13:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,440 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 936 transitions. [2019-11-07 01:13:54,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 936 transitions. [2019-11-07 01:13:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:13:54,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,442 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1117549054, now seen corresponding path program 1 times [2019-11-07 01:13:54,443 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,443 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373336719] [2019-11-07 01:13:54,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373336719] [2019-11-07 01:13:54,480 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,480 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:54,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158752413] [2019-11-07 01:13:54,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:54,481 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:54,481 INFO L87 Difference]: Start difference. First operand 651 states and 936 transitions. Second operand 5 states. [2019-11-07 01:13:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,702 INFO L93 Difference]: Finished difference Result 1357 states and 1942 transitions. [2019-11-07 01:13:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:54,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-07 01:13:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,707 INFO L225 Difference]: With dead ends: 1357 [2019-11-07 01:13:54,707 INFO L226 Difference]: Without dead ends: 720 [2019-11-07 01:13:54,708 INFO L630 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-11-07 01:13:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-07 01:13:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 714. [2019-11-07 01:13:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-07 01:13:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2019-11-07 01:13:54,746 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 43 [2019-11-07 01:13:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,746 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2019-11-07 01:13:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2019-11-07 01:13:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 01:13:54,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,748 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 150670326, now seen corresponding path program 1 times [2019-11-07 01:13:54,748 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128905820] [2019-11-07 01:13:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128905820] [2019-11-07 01:13:54,785 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,785 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:54,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207563769] [2019-11-07 01:13:54,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:54,786 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:54,787 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand 5 states. [2019-11-07 01:13:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:55,003 INFO L93 Difference]: Finished difference Result 1442 states and 2059 transitions. [2019-11-07 01:13:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:55,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-07 01:13:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:55,011 INFO L225 Difference]: With dead ends: 1442 [2019-11-07 01:13:55,012 INFO L226 Difference]: Without dead ends: 742 [2019-11-07 01:13:55,013 INFO L630 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-11-07 01:13:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-11-07 01:13:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 714. [2019-11-07 01:13:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-07 01:13:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1011 transitions. [2019-11-07 01:13:55,068 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1011 transitions. Word has length 44 [2019-11-07 01:13:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:55,069 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1011 transitions. [2019-11-07 01:13:55,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1011 transitions. [2019-11-07 01:13:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 01:13:55,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:55,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:55,071 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash -826101582, now seen corresponding path program 1 times [2019-11-07 01:13:55,071 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:55,071 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638167699] [2019-11-07 01:13:55,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:55,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638167699] [2019-11-07 01:13:55,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:55,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927919474] [2019-11-07 01:13:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:55,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:55,112 INFO L87 Difference]: Start difference. First operand 714 states and 1011 transitions. Second operand 5 states. [2019-11-07 01:13:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:55,336 INFO L93 Difference]: Finished difference Result 1424 states and 2017 transitions. [2019-11-07 01:13:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:55,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-07 01:13:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:55,344 INFO L225 Difference]: With dead ends: 1424 [2019-11-07 01:13:55,344 INFO L226 Difference]: Without dead ends: 724 [2019-11-07 01:13:55,346 INFO L630 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-11-07 01:13:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-07 01:13:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 718. [2019-11-07 01:13:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-11-07 01:13:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1017 transitions. [2019-11-07 01:13:55,384 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1017 transitions. Word has length 44 [2019-11-07 01:13:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:55,384 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1017 transitions. [2019-11-07 01:13:55,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1017 transitions. [2019-11-07 01:13:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 01:13:55,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:55,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:55,386 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 394900860, now seen corresponding path program 1 times [2019-11-07 01:13:55,386 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:55,387 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894579861] [2019-11-07 01:13:55,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:55,423 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894579861] [2019-11-07 01:13:55,423 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:55,424 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:55,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913327078] [2019-11-07 01:13:55,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:55,424 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:55,425 INFO L87 Difference]: Start difference. First operand 718 states and 1017 transitions. Second operand 5 states. [2019-11-07 01:13:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:55,664 INFO L93 Difference]: Finished difference Result 1491 states and 2102 transitions. [2019-11-07 01:13:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:55,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-07 01:13:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:55,669 INFO L225 Difference]: With dead ends: 1491 [2019-11-07 01:13:55,669 INFO L226 Difference]: Without dead ends: 787 [2019-11-07 01:13:55,671 INFO L630 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-11-07 01:13:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-11-07 01:13:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2019-11-07 01:13:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-11-07 01:13:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1100 transitions. [2019-11-07 01:13:55,708 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1100 transitions. Word has length 45 [2019-11-07 01:13:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:55,708 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1100 transitions. [2019-11-07 01:13:55,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1100 transitions. [2019-11-07 01:13:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 01:13:55,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:55,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:55,710 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:55,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2061317727, now seen corresponding path program 1 times [2019-11-07 01:13:55,710 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:55,710 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662865221] [2019-11-07 01:13:55,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:55,782 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662865221] [2019-11-07 01:13:55,782 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:55,782 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:55,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344864732] [2019-11-07 01:13:55,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:55,783 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:55,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:55,784 INFO L87 Difference]: Start difference. First operand 785 states and 1100 transitions. Second operand 5 states. [2019-11-07 01:13:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:56,020 INFO L93 Difference]: Finished difference Result 1570 states and 2201 transitions. [2019-11-07 01:13:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:56,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-07 01:13:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:56,026 INFO L225 Difference]: With dead ends: 1570 [2019-11-07 01:13:56,027 INFO L226 Difference]: Without dead ends: 799 [2019-11-07 01:13:56,030 INFO L630 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-11-07 01:13:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-07 01:13:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 789. [2019-11-07 01:13:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-07 01:13:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1106 transitions. [2019-11-07 01:13:56,093 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1106 transitions. Word has length 47 [2019-11-07 01:13:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:56,094 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1106 transitions. [2019-11-07 01:13:56,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1106 transitions. [2019-11-07 01:13:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 01:13:56,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:56,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:56,096 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2062397286, now seen corresponding path program 1 times [2019-11-07 01:13:56,096 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:56,096 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267336405] [2019-11-07 01:13:56,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:56,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267336405] [2019-11-07 01:13:56,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:56,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:56,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068128190] [2019-11-07 01:13:56,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:56,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:56,138 INFO L87 Difference]: Start difference. First operand 789 states and 1106 transitions. Second operand 5 states. [2019-11-07 01:13:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:56,388 INFO L93 Difference]: Finished difference Result 1659 states and 2324 transitions. [2019-11-07 01:13:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:56,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-07 01:13:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:56,393 INFO L225 Difference]: With dead ends: 1659 [2019-11-07 01:13:56,393 INFO L226 Difference]: Without dead ends: 884 [2019-11-07 01:13:56,395 INFO L630 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-11-07 01:13:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-11-07 01:13:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 870. [2019-11-07 01:13:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-07 01:13:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1213 transitions. [2019-11-07 01:13:56,434 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1213 transitions. Word has length 47 [2019-11-07 01:13:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:56,435 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1213 transitions. [2019-11-07 01:13:56,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1213 transitions. [2019-11-07 01:13:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 01:13:56,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:56,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:56,436 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1357130696, now seen corresponding path program 1 times [2019-11-07 01:13:56,438 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:56,438 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321988130] [2019-11-07 01:13:56,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:56,480 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321988130] [2019-11-07 01:13:56,480 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:56,480 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:56,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204755027] [2019-11-07 01:13:56,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:56,481 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:56,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:56,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:56,481 INFO L87 Difference]: Start difference. First operand 870 states and 1213 transitions. Second operand 5 states. [2019-11-07 01:13:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:56,708 INFO L93 Difference]: Finished difference Result 1738 states and 2423 transitions. [2019-11-07 01:13:56,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:56,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 01:13:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:56,718 INFO L225 Difference]: With dead ends: 1738 [2019-11-07 01:13:56,718 INFO L226 Difference]: Without dead ends: 882 [2019-11-07 01:13:56,720 INFO L630 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-11-07 01:13:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-11-07 01:13:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2019-11-07 01:13:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-07 01:13:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1213 transitions. [2019-11-07 01:13:56,760 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1213 transitions. Word has length 48 [2019-11-07 01:13:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:56,760 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1213 transitions. [2019-11-07 01:13:56,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1213 transitions. [2019-11-07 01:13:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 01:13:56,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:56,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:56,762 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -393720600, now seen corresponding path program 1 times [2019-11-07 01:13:56,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:56,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072231946] [2019-11-07 01:13:56,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:56,798 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072231946] [2019-11-07 01:13:56,799 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:56,799 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:56,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762557289] [2019-11-07 01:13:56,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:56,799 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:56,800 INFO L87 Difference]: Start difference. First operand 872 states and 1213 transitions. Second operand 5 states. [2019-11-07 01:13:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:57,039 INFO L93 Difference]: Finished difference Result 1811 states and 2508 transitions. [2019-11-07 01:13:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:57,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 01:13:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:57,046 INFO L225 Difference]: With dead ends: 1811 [2019-11-07 01:13:57,046 INFO L226 Difference]: Without dead ends: 953 [2019-11-07 01:13:57,048 INFO L630 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-11-07 01:13:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-11-07 01:13:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 947. [2019-11-07 01:13:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-07 01:13:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1304 transitions. [2019-11-07 01:13:57,091 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1304 transitions. Word has length 48 [2019-11-07 01:13:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:57,092 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1304 transitions. [2019-11-07 01:13:57,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1304 transitions. [2019-11-07 01:13:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 01:13:57,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:57,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:57,093 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:57,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:57,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1882441225, now seen corresponding path program 1 times [2019-11-07 01:13:57,094 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:57,094 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548041373] [2019-11-07 01:13:57,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:57,130 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548041373] [2019-11-07 01:13:57,131 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:57,131 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:57,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258384661] [2019-11-07 01:13:57,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:57,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:57,132 INFO L87 Difference]: Start difference. First operand 947 states and 1304 transitions. Second operand 5 states. [2019-11-07 01:13:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:57,387 INFO L93 Difference]: Finished difference Result 1904 states and 2631 transitions. [2019-11-07 01:13:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:57,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 01:13:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:57,393 INFO L225 Difference]: With dead ends: 1904 [2019-11-07 01:13:57,394 INFO L226 Difference]: Without dead ends: 971 [2019-11-07 01:13:57,396 INFO L630 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-11-07 01:13:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-11-07 01:13:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 957. [2019-11-07 01:13:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-07 01:13:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1322 transitions. [2019-11-07 01:13:57,439 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1322 transitions. Word has length 48 [2019-11-07 01:13:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:57,439 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1322 transitions. [2019-11-07 01:13:57,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1322 transitions. [2019-11-07 01:13:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 01:13:57,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:57,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:57,441 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash -368829041, now seen corresponding path program 1 times [2019-11-07 01:13:57,441 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:57,441 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014442293] [2019-11-07 01:13:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:57,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014442293] [2019-11-07 01:13:57,477 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:57,477 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:57,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164365882] [2019-11-07 01:13:57,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:57,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:57,478 INFO L87 Difference]: Start difference. First operand 957 states and 1322 transitions. Second operand 5 states. [2019-11-07 01:13:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:57,735 INFO L93 Difference]: Finished difference Result 1906 states and 2631 transitions. [2019-11-07 01:13:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:57,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-07 01:13:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:57,739 INFO L225 Difference]: With dead ends: 1906 [2019-11-07 01:13:57,740 INFO L226 Difference]: Without dead ends: 963 [2019-11-07 01:13:57,743 INFO L630 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-11-07 01:13:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-07 01:13:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 957. [2019-11-07 01:13:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-07 01:13:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1318 transitions. [2019-11-07 01:13:57,799 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1318 transitions. Word has length 49 [2019-11-07 01:13:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:57,799 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1318 transitions. [2019-11-07 01:13:57,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1318 transitions. [2019-11-07 01:13:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 01:13:57,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:57,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:57,801 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267133, now seen corresponding path program 1 times [2019-11-07 01:13:57,801 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:57,801 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143061133] [2019-11-07 01:13:57,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:57,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143061133] [2019-11-07 01:13:57,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:57,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:57,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509584418] [2019-11-07 01:13:57,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:57,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:57,851 INFO L87 Difference]: Start difference. First operand 957 states and 1318 transitions. Second operand 5 states. [2019-11-07 01:13:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:58,111 INFO L93 Difference]: Finished difference Result 1983 states and 2718 transitions. [2019-11-07 01:13:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:58,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-07 01:13:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:58,116 INFO L225 Difference]: With dead ends: 1983 [2019-11-07 01:13:58,117 INFO L226 Difference]: Without dead ends: 1040 [2019-11-07 01:13:58,119 INFO L630 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-11-07 01:13:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-07 01:13:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-11-07 01:13:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-07 01:13:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1409 transitions. [2019-11-07 01:13:58,168 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1409 transitions. Word has length 50 [2019-11-07 01:13:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:58,168 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1409 transitions. [2019-11-07 01:13:58,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1409 transitions. [2019-11-07 01:13:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 01:13:58,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:58,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:58,170 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 36294858, now seen corresponding path program 1 times [2019-11-07 01:13:58,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:58,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560991688] [2019-11-07 01:13:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:58,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560991688] [2019-11-07 01:13:58,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:58,209 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:58,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040666279] [2019-11-07 01:13:58,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:58,210 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:58,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:58,213 INFO L87 Difference]: Start difference. First operand 1034 states and 1409 transitions. Second operand 5 states. [2019-11-07 01:13:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:58,488 INFO L93 Difference]: Finished difference Result 2060 states and 2805 transitions. [2019-11-07 01:13:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:58,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-07 01:13:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:58,494 INFO L225 Difference]: With dead ends: 2060 [2019-11-07 01:13:58,494 INFO L226 Difference]: Without dead ends: 1040 [2019-11-07 01:13:58,496 INFO L630 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-11-07 01:13:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-07 01:13:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-11-07 01:13:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-07 01:13:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1405 transitions. [2019-11-07 01:13:58,543 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1405 transitions. Word has length 51 [2019-11-07 01:13:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:58,544 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1405 transitions. [2019-11-07 01:13:58,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1405 transitions. [2019-11-07 01:13:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:13:58,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:58,545 INFO L410 BasicCegarLoop]: trace histogram [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-11-07 01:13:58,546 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1896340220, now seen corresponding path program 1 times [2019-11-07 01:13:58,546 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:58,548 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052865718] [2019-11-07 01:13:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:58,574 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052865718] [2019-11-07 01:13:58,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:58,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:58,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979127397] [2019-11-07 01:13:58,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:58,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:58,575 INFO L87 Difference]: Start difference. First operand 1034 states and 1405 transitions. Second operand 3 states. [2019-11-07 01:13:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:58,620 INFO L93 Difference]: Finished difference Result 2054 states and 2792 transitions. [2019-11-07 01:13:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 01:13:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:58,625 INFO L225 Difference]: With dead ends: 2054 [2019-11-07 01:13:58,625 INFO L226 Difference]: Without dead ends: 1034 [2019-11-07 01:13:58,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-11-07 01:13:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-11-07 01:13:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-07 01:13:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1378 transitions. [2019-11-07 01:13:58,676 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1378 transitions. Word has length 54 [2019-11-07 01:13:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:58,676 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1378 transitions. [2019-11-07 01:13:58,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1378 transitions. [2019-11-07 01:13:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:13:58,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:58,677 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-07 01:13:58,678 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1048271307, now seen corresponding path program 1 times [2019-11-07 01:13:58,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:58,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004737819] [2019-11-07 01:13:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:58,705 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004737819] [2019-11-07 01:13:58,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:58,706 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:58,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103020992] [2019-11-07 01:13:58,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:58,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:58,707 INFO L87 Difference]: Start difference. First operand 1034 states and 1378 transitions. Second operand 3 states. [2019-11-07 01:13:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:58,813 INFO L93 Difference]: Finished difference Result 2072 states and 2760 transitions. [2019-11-07 01:13:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:58,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-07 01:13:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:58,819 INFO L225 Difference]: With dead ends: 2072 [2019-11-07 01:13:58,819 INFO L226 Difference]: Without dead ends: 1052 [2019-11-07 01:13:58,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-07 01:13:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-11-07 01:13:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-11-07 01:13:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1369 transitions. [2019-11-07 01:13:58,883 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1369 transitions. Word has length 55 [2019-11-07 01:13:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:58,883 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1369 transitions. [2019-11-07 01:13:58,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1369 transitions. [2019-11-07 01:13:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:13:58,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:58,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:58,885 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1564495280, now seen corresponding path program 1 times [2019-11-07 01:13:58,885 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:58,886 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772410288] [2019-11-07 01:13:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:58,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772410288] [2019-11-07 01:13:58,930 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:58,931 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:58,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844378273] [2019-11-07 01:13:58,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:58,931 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:58,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:58,932 INFO L87 Difference]: Start difference. First operand 1046 states and 1369 transitions. Second operand 5 states. [2019-11-07 01:13:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:59,228 INFO L93 Difference]: Finished difference Result 2175 states and 2835 transitions. [2019-11-07 01:13:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:59,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-07 01:13:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:59,234 INFO L225 Difference]: With dead ends: 2175 [2019-11-07 01:13:59,234 INFO L226 Difference]: Without dead ends: 1143 [2019-11-07 01:13:59,236 INFO L630 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-11-07 01:13:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-11-07 01:13:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1131. [2019-11-07 01:13:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-07 01:13:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1451 transitions. [2019-11-07 01:13:59,297 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1451 transitions. Word has length 57 [2019-11-07 01:13:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:59,297 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1451 transitions. [2019-11-07 01:13:59,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1451 transitions. [2019-11-07 01:13:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:13:59,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:59,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:59,299 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash -928520343, now seen corresponding path program 1 times [2019-11-07 01:13:59,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:59,300 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052209496] [2019-11-07 01:13:59,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:59,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052209496] [2019-11-07 01:13:59,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:59,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:59,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340842896] [2019-11-07 01:13:59,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:59,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:59,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:59,340 INFO L87 Difference]: Start difference. First operand 1131 states and 1451 transitions. Second operand 5 states. [2019-11-07 01:13:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:59,584 INFO L93 Difference]: Finished difference Result 2266 states and 2910 transitions. [2019-11-07 01:13:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:59,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-07 01:13:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:59,589 INFO L225 Difference]: With dead ends: 2266 [2019-11-07 01:13:59,589 INFO L226 Difference]: Without dead ends: 1149 [2019-11-07 01:13:59,591 INFO L630 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-11-07 01:13:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-11-07 01:13:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1135. [2019-11-07 01:13:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-11-07 01:13:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1456 transitions. [2019-11-07 01:13:59,645 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1456 transitions. Word has length 58 [2019-11-07 01:13:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:59,646 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 1456 transitions. [2019-11-07 01:13:59,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1456 transitions. [2019-11-07 01:13:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:13:59,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:59,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:59,647 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash 332165990, now seen corresponding path program 1 times [2019-11-07 01:13:59,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:59,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751520760] [2019-11-07 01:13:59,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:59,700 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751520760] [2019-11-07 01:13:59,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:59,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:59,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138667091] [2019-11-07 01:13:59,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:59,701 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:59,701 INFO L87 Difference]: Start difference. First operand 1135 states and 1456 transitions. Second operand 5 states. [2019-11-07 01:13:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:59,973 INFO L93 Difference]: Finished difference Result 2357 states and 3013 transitions. [2019-11-07 01:13:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:59,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 01:13:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:59,979 INFO L225 Difference]: With dead ends: 2357 [2019-11-07 01:13:59,979 INFO L226 Difference]: Without dead ends: 1236 [2019-11-07 01:13:59,985 INFO L630 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-11-07 01:13:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-07 01:14:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1224. [2019-11-07 01:14:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-07 01:14:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1556 transitions. [2019-11-07 01:14:00,042 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1556 transitions. Word has length 59 [2019-11-07 01:14:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:00,042 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1556 transitions. [2019-11-07 01:14:00,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1556 transitions. [2019-11-07 01:14:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:14:00,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:00,043 INFO L410 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] [2019-11-07 01:14:00,044 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1890648705, now seen corresponding path program 1 times [2019-11-07 01:14:00,044 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:00,044 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677633050] [2019-11-07 01:14:00,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:00,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677633050] [2019-11-07 01:14:00,069 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:00,069 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:00,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143005049] [2019-11-07 01:14:00,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:00,070 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:00,071 INFO L87 Difference]: Start difference. First operand 1224 states and 1556 transitions. Second operand 3 states. [2019-11-07 01:14:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:00,177 INFO L93 Difference]: Finished difference Result 3630 states and 4604 transitions. [2019-11-07 01:14:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:00,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:14:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:00,197 INFO L225 Difference]: With dead ends: 3630 [2019-11-07 01:14:00,197 INFO L226 Difference]: Without dead ends: 2420 [2019-11-07 01:14:00,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-11-07 01:14:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1840. [2019-11-07 01:14:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-11-07 01:14:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2331 transitions. [2019-11-07 01:14:00,291 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2331 transitions. Word has length 60 [2019-11-07 01:14:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:00,291 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 2331 transitions. [2019-11-07 01:14:00,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2331 transitions. [2019-11-07 01:14:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:14:00,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:00,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:14:00,293 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1918883551, now seen corresponding path program 1 times [2019-11-07 01:14:00,294 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:00,294 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536657745] [2019-11-07 01:14:00,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:00,332 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536657745] [2019-11-07 01:14:00,332 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:00,332 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:00,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364469936] [2019-11-07 01:14:00,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:00,333 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:00,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:00,334 INFO L87 Difference]: Start difference. First operand 1840 states and 2331 transitions. Second operand 5 states. [2019-11-07 01:14:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:00,607 INFO L93 Difference]: Finished difference Result 3688 states and 4677 transitions. [2019-11-07 01:14:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:00,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-07 01:14:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:00,618 INFO L225 Difference]: With dead ends: 3688 [2019-11-07 01:14:00,618 INFO L226 Difference]: Without dead ends: 1788 [2019-11-07 01:14:00,622 INFO L630 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-11-07 01:14:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-11-07 01:14:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1771. [2019-11-07 01:14:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-07 01:14:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2226 transitions. [2019-11-07 01:14:00,732 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2226 transitions. Word has length 60 [2019-11-07 01:14:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:00,733 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2226 transitions. [2019-11-07 01:14:00,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2226 transitions. [2019-11-07 01:14:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:14:00,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:00,734 INFO L410 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] [2019-11-07 01:14:00,734 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1409568447, now seen corresponding path program 1 times [2019-11-07 01:14:00,735 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:00,735 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332590021] [2019-11-07 01:14:00,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-07 01:14:00,758 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332590021] [2019-11-07 01:14:00,758 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:00,758 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:00,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907544198] [2019-11-07 01:14:00,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:00,759 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:00,760 INFO L87 Difference]: Start difference. First operand 1771 states and 2226 transitions. Second operand 3 states. [2019-11-07 01:14:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:00,963 INFO L93 Difference]: Finished difference Result 3545 states and 4460 transitions. [2019-11-07 01:14:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:00,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:14:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:00,966 INFO L225 Difference]: With dead ends: 3545 [2019-11-07 01:14:00,966 INFO L226 Difference]: Without dead ends: 1789 [2019-11-07 01:14:00,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-11-07 01:14:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1771. [2019-11-07 01:14:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-07 01:14:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2221 transitions. [2019-11-07 01:14:01,035 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2221 transitions. Word has length 60 [2019-11-07 01:14:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:01,035 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2221 transitions. [2019-11-07 01:14:01,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2221 transitions. [2019-11-07 01:14:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:14:01,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:01,036 INFO L410 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] [2019-11-07 01:14:01,037 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2089626817, now seen corresponding path program 1 times [2019-11-07 01:14:01,037 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:01,037 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484111254] [2019-11-07 01:14:01,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:14:01,073 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484111254] [2019-11-07 01:14:01,073 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:01,073 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:01,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180720400] [2019-11-07 01:14:01,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:01,074 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:01,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:01,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:01,074 INFO L87 Difference]: Start difference. First operand 1771 states and 2221 transitions. Second operand 3 states. [2019-11-07 01:14:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:01,178 INFO L93 Difference]: Finished difference Result 3492 states and 4355 transitions. [2019-11-07 01:14:01,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:01,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:14:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:01,182 INFO L225 Difference]: With dead ends: 3492 [2019-11-07 01:14:01,182 INFO L226 Difference]: Without dead ends: 2328 [2019-11-07 01:14:01,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-11-07 01:14:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1763. [2019-11-07 01:14:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-11-07 01:14:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2196 transitions. [2019-11-07 01:14:01,243 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2196 transitions. Word has length 60 [2019-11-07 01:14:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:01,243 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2196 transitions. [2019-11-07 01:14:01,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2196 transitions. [2019-11-07 01:14:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 01:14:01,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:01,244 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:01,244 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:01,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1796569389, now seen corresponding path program 1 times [2019-11-07 01:14:01,245 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:01,245 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986955579] [2019-11-07 01:14:01,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:01,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986955579] [2019-11-07 01:14:01,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:01,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:01,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226537124] [2019-11-07 01:14:01,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:01,286 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:01,286 INFO L87 Difference]: Start difference. First operand 1763 states and 2196 transitions. Second operand 3 states. [2019-11-07 01:14:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:01,448 INFO L93 Difference]: Finished difference Result 5220 states and 6468 transitions. [2019-11-07 01:14:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:01,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-07 01:14:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:01,455 INFO L225 Difference]: With dead ends: 5220 [2019-11-07 01:14:01,455 INFO L226 Difference]: Without dead ends: 3472 [2019-11-07 01:14:01,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-11-07 01:14:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2019-11-07 01:14:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3470 states. [2019-11-07 01:14:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4239 transitions. [2019-11-07 01:14:01,642 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4239 transitions. Word has length 61 [2019-11-07 01:14:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:01,642 INFO L462 AbstractCegarLoop]: Abstraction has 3470 states and 4239 transitions. [2019-11-07 01:14:01,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4239 transitions. [2019-11-07 01:14:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 01:14:01,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:01,644 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:01,644 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425408, now seen corresponding path program 1 times [2019-11-07 01:14:01,645 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:01,646 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610553228] [2019-11-07 01:14:01,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 01:14:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 01:14:01,736 INFO L172 FreeRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-11-07 01:14:01,736 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-07 01:14:01,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:14:01 BoogieIcfgContainer [2019-11-07 01:14:01,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:14:01,873 INFO L168 Benchmark]: Toolchain (without parser) took 15333.05 ms. Allocated memory was 144.2 MB in the beginning and 472.9 MB in the end (delta: 328.7 MB). Free memory was 101.8 MB in the beginning and 233.6 MB in the end (delta: -131.8 MB). Peak memory consumption was 196.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,874 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.09 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 177.3 MB in the end (delta: -75.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,878 INFO L168 Benchmark]: Boogie Preprocessor took 60.75 ms. Allocated memory is still 202.4 MB. Free memory was 177.3 MB in the beginning and 174.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,879 INFO L168 Benchmark]: RCFGBuilder took 961.40 ms. Allocated memory is still 202.4 MB. Free memory was 174.4 MB in the beginning and 121.5 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,879 INFO L168 Benchmark]: TraceAbstraction took 13771.67 ms. Allocated memory was 202.4 MB in the beginning and 472.9 MB in the end (delta: 270.5 MB). Free memory was 121.5 MB in the beginning and 233.6 MB in the end (delta: -112.0 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2019-11-07 01:14:01,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 534.09 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 177.3 MB in the end (delta: -75.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.75 ms. Allocated memory is still 202.4 MB. Free memory was 177.3 MB in the beginning and 174.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 961.40 ms. Allocated memory is still 202.4 MB. Free memory was 174.4 MB in the beginning and 121.5 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13771.67 ms. Allocated memory was 202.4 MB in the beginning and 472.9 MB in the end (delta: 270.5 MB). Free memory was 121.5 MB in the beginning and 233.6 MB in the end (delta: -112.0 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L646] int s ; [L647] int tmp ; [L651] s = 8464 VAL [s=8464] [L652] CALL ssl3_accept(s) VAL [\old(initial_state)=8464] [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__s3__tmp__reuse_message = 0 [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 VAL [\old(initial_state)=8464, blastFlag=0, cb=0, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L89] s__in_handshake ++ VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L90] COND TRUE tmp___1 + 12288 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L91] COND TRUE tmp___2 + 16384 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L95] COND FALSE !(s__cert == 0) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L99] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L101] state = s__state VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L102] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L105] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L108] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L111] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L114] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L117] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L120] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L123] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L126] COND TRUE s__state == 8464 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L603] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L604] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L605] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L606] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L607] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L608] COND FALSE !(state == 8496) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L615] COND FALSE !(\read(s__debug)) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L621] COND TRUE cb != 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L622] COND TRUE s__state != state [L623] new_state = s__state [L624] s__state = state [L625] s__state = new_state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L630] skip = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L99] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L101] state = s__state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L102] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L105] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L108] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L111] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L114] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L117] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L120] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L123] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L126] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L129] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L132] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L135] COND TRUE s__state == 8496 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L290] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L298] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L603] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L604] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L605] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L606] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L607] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L608] COND TRUE state == 8496 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L641] __VERIFIER_error() VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 42, TraceHistogramMax: 2, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7582 SDtfs, 15139 SDslu, 7637 SDs, 0 SdLazy, 5353 SolverSat, 1506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3470occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 41 MinimizatonAttempts, 1597 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1864 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1761 ConstructedInterpolants, 0 QuantifiedInterpolants, 234972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...