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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:04,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:04,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:04,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:04,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:04,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:04,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:04,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:04,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:04,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:04,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:04,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:04,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:04,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:04,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:04,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:04,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:04,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:04,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:04,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:04,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:04,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:04,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:04,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:04,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:04,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:04,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:04,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:04,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:04,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:04,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:04,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:04,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:04,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:04,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:04,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:04,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:04,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:04,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:04,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:04,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:04,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:09:04,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:04,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:04,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:04,424 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:04,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:04,425 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:04,425 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:04,425 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:04,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:04,426 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:04,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:04,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:04,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:04,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:04,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:04,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:04,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:04,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:04,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:04,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:04,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:04,430 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:04,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:04,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:04,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:04,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:04,432 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:04,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:04,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:04,432 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:04,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:04,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:04,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:04,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:04,522 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:04,523 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-10-03 04:09:04,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49072b7/fc44d81144224cf2b6aa618980c03857/FLAG6b604fcea [2019-10-03 04:09:05,056 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:05,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-10-03 04:09:05,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49072b7/fc44d81144224cf2b6aa618980c03857/FLAG6b604fcea [2019-10-03 04:09:05,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49072b7/fc44d81144224cf2b6aa618980c03857 [2019-10-03 04:09:05,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:05,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:05,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:05,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:05,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:05,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74efd7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05, skipping insertion in model container [2019-10-03 04:09:05,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,375 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:05,419 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:05,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:05,774 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:05,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:05,886 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:05,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05 WrapperNode [2019-10-03 04:09:05,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:05,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:05,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:05,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:05,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:05,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:05,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:05,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:05,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:06,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:06,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:06,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-03 04:09:06,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:06,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:06,271 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:09:06,861 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-03 04:09:06,862 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-03 04:09:06,866 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:06,866 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:06,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:06 BoogieIcfgContainer [2019-10-03 04:09:06,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:06,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:06,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:06,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:06,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:05" (1/3) ... [2019-10-03 04:09:06,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f30a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:06, skipping insertion in model container [2019-10-03 04:09:06,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05" (2/3) ... [2019-10-03 04:09:06,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f30a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:06, skipping insertion in model container [2019-10-03 04:09:06,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:06" (3/3) ... [2019-10-03 04:09:06,880 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-10-03 04:09:06,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:06,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:06,921 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:06,956 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:06,956 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:06,956 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:06,956 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:06,957 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:06,957 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:06,957 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:06,957 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-10-03 04:09:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 04:09:06,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:06,987 INFO L411 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-10-03 04:09:06,990 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2138433857, now seen corresponding path program 1 times [2019-10-03 04:09:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:07,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:07,296 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 5 states. [2019-10-03 04:09:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,734 INFO L93 Difference]: Finished difference Result 187 states and 309 transitions. [2019-10-03 04:09:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:07,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-03 04:09:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,750 INFO L225 Difference]: With dead ends: 187 [2019-10-03 04:09:07,750 INFO L226 Difference]: Without dead ends: 166 [2019-10-03 04:09:07,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-03 04:09:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-10-03 04:09:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-03 04:09:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2019-10-03 04:09:07,809 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 28 [2019-10-03 04:09:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,809 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2019-10-03 04:09:07,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2019-10-03 04:09:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 04:09:07,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,812 INFO L411 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-10-03 04:09:07,812 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1059341068, now seen corresponding path program 1 times [2019-10-03 04:09:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:07,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:07,958 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand 5 states. [2019-10-03 04:09:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,204 INFO L93 Difference]: Finished difference Result 187 states and 288 transitions. [2019-10-03 04:09:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-03 04:09:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,207 INFO L225 Difference]: With dead ends: 187 [2019-10-03 04:09:08,207 INFO L226 Difference]: Without dead ends: 187 [2019-10-03 04:09:08,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-03 04:09:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-10-03 04:09:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-03 04:09:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2019-10-03 04:09:08,224 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 29 [2019-10-03 04:09:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,225 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2019-10-03 04:09:08,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2019-10-03 04:09:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 04:09:08,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,232 INFO L411 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-10-03 04:09:08,232 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash -947080425, now seen corresponding path program 1 times [2019-10-03 04:09:08,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,370 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand 5 states. [2019-10-03 04:09:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,598 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2019-10-03 04:09:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-03 04:09:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,601 INFO L225 Difference]: With dead ends: 195 [2019-10-03 04:09:08,602 INFO L226 Difference]: Without dead ends: 195 [2019-10-03 04:09:08,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-03 04:09:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-10-03 04:09:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-03 04:09:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2019-10-03 04:09:08,614 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 29 [2019-10-03 04:09:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,615 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2019-10-03 04:09:08,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2019-10-03 04:09:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 04:09:08,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,616 INFO L411 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-10-03 04:09:08,617 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 837081432, now seen corresponding path program 1 times [2019-10-03 04:09:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,698 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand 5 states. [2019-10-03 04:09:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,944 INFO L93 Difference]: Finished difference Result 194 states and 300 transitions. [2019-10-03 04:09:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-03 04:09:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,946 INFO L225 Difference]: With dead ends: 194 [2019-10-03 04:09:08,947 INFO L226 Difference]: Without dead ends: 194 [2019-10-03 04:09:08,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-03 04:09:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-10-03 04:09:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 299 transitions. [2019-10-03 04:09:08,973 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 299 transitions. Word has length 29 [2019-10-03 04:09:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,973 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 299 transitions. [2019-10-03 04:09:08,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 299 transitions. [2019-10-03 04:09:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 04:09:08,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,975 INFO L411 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-10-03 04:09:08,975 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2002433700, now seen corresponding path program 1 times [2019-10-03 04:09:08,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,063 INFO L87 Difference]: Start difference. First operand 192 states and 299 transitions. Second operand 5 states. [2019-10-03 04:09:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,244 INFO L93 Difference]: Finished difference Result 204 states and 310 transitions. [2019-10-03 04:09:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-03 04:09:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,247 INFO L225 Difference]: With dead ends: 204 [2019-10-03 04:09:09,247 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 04:09:09,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 04:09:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-03 04:09:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 297 transitions. [2019-10-03 04:09:09,254 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 297 transitions. Word has length 30 [2019-10-03 04:09:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,255 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 297 transitions. [2019-10-03 04:09:09,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 297 transitions. [2019-10-03 04:09:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 04:09:09,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,256 INFO L411 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-10-03 04:09:09,257 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash 533516532, now seen corresponding path program 1 times [2019-10-03 04:09:09,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,305 INFO L87 Difference]: Start difference. First operand 192 states and 297 transitions. Second operand 5 states. [2019-10-03 04:09:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,473 INFO L93 Difference]: Finished difference Result 204 states and 308 transitions. [2019-10-03 04:09:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-03 04:09:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,475 INFO L225 Difference]: With dead ends: 204 [2019-10-03 04:09:09,476 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 04:09:09,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 04:09:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-03 04:09:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2019-10-03 04:09:09,483 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 31 [2019-10-03 04:09:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,483 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2019-10-03 04:09:09,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2019-10-03 04:09:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 04:09:09,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,485 INFO L411 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-10-03 04:09:09,485 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -714108489, now seen corresponding path program 1 times [2019-10-03 04:09:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,547 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand 5 states. [2019-10-03 04:09:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,702 INFO L93 Difference]: Finished difference Result 204 states and 306 transitions. [2019-10-03 04:09:09,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-03 04:09:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,705 INFO L225 Difference]: With dead ends: 204 [2019-10-03 04:09:09,705 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 04:09:09,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 04:09:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-03 04:09:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2019-10-03 04:09:09,712 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 32 [2019-10-03 04:09:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,712 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-10-03 04:09:09,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2019-10-03 04:09:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 04:09:09,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,714 INFO L411 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-10-03 04:09:09,714 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 522773526, now seen corresponding path program 1 times [2019-10-03 04:09:09,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:09,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:09,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:09,745 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand 3 states. [2019-10-03 04:09:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,759 INFO L93 Difference]: Finished difference Result 363 states and 549 transitions. [2019-10-03 04:09:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:09,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 04:09:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,762 INFO L225 Difference]: With dead ends: 363 [2019-10-03 04:09:09,762 INFO L226 Difference]: Without dead ends: 363 [2019-10-03 04:09:09,763 INFO L640 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-10-03 04:09:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-03 04:09:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-10-03 04:09:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-03 04:09:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-10-03 04:09:09,777 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 32 [2019-10-03 04:09:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,778 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-10-03 04:09:09,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-10-03 04:09:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 04:09:09,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,779 INFO L411 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-10-03 04:09:09,780 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1890290600, now seen corresponding path program 1 times [2019-10-03 04:09:09,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:09:09,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:09,856 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-10-03 04:09:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,073 INFO L93 Difference]: Finished difference Result 435 states and 656 transitions. [2019-10-03 04:09:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:10,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-03 04:09:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,076 INFO L225 Difference]: With dead ends: 435 [2019-10-03 04:09:10,076 INFO L226 Difference]: Without dead ends: 435 [2019-10-03 04:09:10,077 INFO L640 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-10-03 04:09:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-03 04:09:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 370. [2019-10-03 04:09:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-03 04:09:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2019-10-03 04:09:10,088 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 33 [2019-10-03 04:09:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,088 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2019-10-03 04:09:10,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2019-10-03 04:09:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 04:09:10,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,090 INFO L411 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-10-03 04:09:10,090 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -784025939, now seen corresponding path program 1 times [2019-10-03 04:09:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:10,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,132 INFO L87 Difference]: Start difference. First operand 370 states and 563 transitions. Second operand 5 states. [2019-10-03 04:09:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,307 INFO L93 Difference]: Finished difference Result 392 states and 584 transitions. [2019-10-03 04:09:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-03 04:09:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,310 INFO L225 Difference]: With dead ends: 392 [2019-10-03 04:09:10,310 INFO L226 Difference]: Without dead ends: 392 [2019-10-03 04:09:10,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-03 04:09:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 370. [2019-10-03 04:09:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-03 04:09:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2019-10-03 04:09:10,320 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 34 [2019-10-03 04:09:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,321 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2019-10-03 04:09:10,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2019-10-03 04:09:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 04:09:10,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,322 INFO L411 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-10-03 04:09:10,322 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -48568943, now seen corresponding path program 1 times [2019-10-03 04:09:10,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:10,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,364 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand 5 states. [2019-10-03 04:09:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,530 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2019-10-03 04:09:10,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-03 04:09:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,533 INFO L225 Difference]: With dead ends: 382 [2019-10-03 04:09:10,533 INFO L226 Difference]: Without dead ends: 382 [2019-10-03 04:09:10,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-03 04:09:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-10-03 04:09:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-03 04:09:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 565 transitions. [2019-10-03 04:09:10,543 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 565 transitions. Word has length 34 [2019-10-03 04:09:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,544 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 565 transitions. [2019-10-03 04:09:10,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 565 transitions. [2019-10-03 04:09:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 04:09:10,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,545 INFO L411 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-10-03 04:09:10,545 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,545 INFO L82 PathProgramCache]: Analyzing trace with hash 815405373, now seen corresponding path program 1 times [2019-10-03 04:09:10,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:10,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,586 INFO L87 Difference]: Start difference. First operand 374 states and 565 transitions. Second operand 5 states. [2019-10-03 04:09:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,788 INFO L93 Difference]: Finished difference Result 427 states and 635 transitions. [2019-10-03 04:09:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-03 04:09:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,791 INFO L225 Difference]: With dead ends: 427 [2019-10-03 04:09:10,791 INFO L226 Difference]: Without dead ends: 427 [2019-10-03 04:09:10,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-03 04:09:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2019-10-03 04:09:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-03 04:09:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 626 transitions. [2019-10-03 04:09:10,803 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 626 transitions. Word has length 35 [2019-10-03 04:09:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,804 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 626 transitions. [2019-10-03 04:09:10,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 626 transitions. [2019-10-03 04:09:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 04:09:10,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,805 INFO L411 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-10-03 04:09:10,805 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1933074875, now seen corresponding path program 1 times [2019-10-03 04:09:10,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,845 INFO L87 Difference]: Start difference. First operand 419 states and 626 transitions. Second operand 5 states. [2019-10-03 04:09:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,071 INFO L93 Difference]: Finished difference Result 478 states and 706 transitions. [2019-10-03 04:09:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 04:09:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,075 INFO L225 Difference]: With dead ends: 478 [2019-10-03 04:09:11,075 INFO L226 Difference]: Without dead ends: 478 [2019-10-03 04:09:11,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-03 04:09:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2019-10-03 04:09:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-03 04:09:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2019-10-03 04:09:11,093 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 38 [2019-10-03 04:09:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2019-10-03 04:09:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2019-10-03 04:09:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 04:09:11,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,094 INFO L411 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-10-03 04:09:11,095 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1841800743, now seen corresponding path program 1 times [2019-10-03 04:09:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,156 INFO L87 Difference]: Start difference. First operand 468 states and 693 transitions. Second operand 5 states. [2019-10-03 04:09:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,375 INFO L93 Difference]: Finished difference Result 533 states and 779 transitions. [2019-10-03 04:09:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 04:09:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,380 INFO L225 Difference]: With dead ends: 533 [2019-10-03 04:09:11,380 INFO L226 Difference]: Without dead ends: 533 [2019-10-03 04:09:11,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-03 04:09:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 523. [2019-10-03 04:09:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-03 04:09:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 768 transitions. [2019-10-03 04:09:11,401 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 768 transitions. Word has length 38 [2019-10-03 04:09:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,402 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 768 transitions. [2019-10-03 04:09:11,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 768 transitions. [2019-10-03 04:09:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 04:09:11,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,404 INFO L411 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-10-03 04:09:11,404 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -416177979, now seen corresponding path program 1 times [2019-10-03 04:09:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,466 INFO L87 Difference]: Start difference. First operand 523 states and 768 transitions. Second operand 5 states. [2019-10-03 04:09:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,644 INFO L93 Difference]: Finished difference Result 539 states and 789 transitions. [2019-10-03 04:09:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-03 04:09:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,647 INFO L225 Difference]: With dead ends: 539 [2019-10-03 04:09:11,648 INFO L226 Difference]: Without dead ends: 539 [2019-10-03 04:09:11,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-10-03 04:09:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-10-03 04:09:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-03 04:09:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2019-10-03 04:09:11,664 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 39 [2019-10-03 04:09:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,665 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2019-10-03 04:09:11,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2019-10-03 04:09:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 04:09:11,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,667 INFO L411 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-10-03 04:09:11,667 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -758043503, now seen corresponding path program 1 times [2019-10-03 04:09:11,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,748 INFO L87 Difference]: Start difference. First operand 529 states and 778 transitions. Second operand 5 states. [2019-10-03 04:09:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,921 INFO L93 Difference]: Finished difference Result 539 states and 787 transitions. [2019-10-03 04:09:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-03 04:09:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,924 INFO L225 Difference]: With dead ends: 539 [2019-10-03 04:09:11,925 INFO L226 Difference]: Without dead ends: 539 [2019-10-03 04:09:11,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-10-03 04:09:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-10-03 04:09:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-03 04:09:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 774 transitions. [2019-10-03 04:09:11,937 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 774 transitions. Word has length 39 [2019-10-03 04:09:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,938 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 774 transitions. [2019-10-03 04:09:11,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 774 transitions. [2019-10-03 04:09:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 04:09:11,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,939 INFO L411 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-10-03 04:09:11,939 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -342748957, now seen corresponding path program 1 times [2019-10-03 04:09:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,987 INFO L87 Difference]: Start difference. First operand 529 states and 774 transitions. Second operand 5 states. [2019-10-03 04:09:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,173 INFO L93 Difference]: Finished difference Result 606 states and 880 transitions. [2019-10-03 04:09:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-03 04:09:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,177 INFO L225 Difference]: With dead ends: 606 [2019-10-03 04:09:12,177 INFO L226 Difference]: Without dead ends: 606 [2019-10-03 04:09:12,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-03 04:09:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2019-10-03 04:09:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 04:09:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 853 transitions. [2019-10-03 04:09:12,194 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 853 transitions. Word has length 40 [2019-10-03 04:09:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,194 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 853 transitions. [2019-10-03 04:09:12,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 853 transitions. [2019-10-03 04:09:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 04:09:12,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,196 INFO L411 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-10-03 04:09:12,196 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1593154033, now seen corresponding path program 1 times [2019-10-03 04:09:12,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:12,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,243 INFO L87 Difference]: Start difference. First operand 588 states and 853 transitions. Second operand 5 states. [2019-10-03 04:09:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,481 INFO L93 Difference]: Finished difference Result 614 states and 894 transitions. [2019-10-03 04:09:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-03 04:09:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,484 INFO L225 Difference]: With dead ends: 614 [2019-10-03 04:09:12,485 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 04:09:12,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 04:09:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2019-10-03 04:09:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 04:09:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 867 transitions. [2019-10-03 04:09:12,499 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 867 transitions. Word has length 41 [2019-10-03 04:09:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,500 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 867 transitions. [2019-10-03 04:09:12,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 867 transitions. [2019-10-03 04:09:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 04:09:12,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,501 INFO L411 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-10-03 04:09:12,501 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -104670206, now seen corresponding path program 1 times [2019-10-03 04:09:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,552 INFO L87 Difference]: Start difference. First operand 596 states and 867 transitions. Second operand 5 states. [2019-10-03 04:09:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,759 INFO L93 Difference]: Finished difference Result 679 states and 979 transitions. [2019-10-03 04:09:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-03 04:09:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,763 INFO L225 Difference]: With dead ends: 679 [2019-10-03 04:09:12,763 INFO L226 Difference]: Without dead ends: 679 [2019-10-03 04:09:12,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-10-03 04:09:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 651. [2019-10-03 04:09:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 04:09:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 936 transitions. [2019-10-03 04:09:12,779 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 936 transitions. Word has length 43 [2019-10-03 04:09:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,779 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 936 transitions. [2019-10-03 04:09:12,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 936 transitions. [2019-10-03 04:09:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 04:09:12,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,781 INFO L411 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-10-03 04:09:12,781 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1117549054, now seen corresponding path program 1 times [2019-10-03 04:09:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:12,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,824 INFO L87 Difference]: Start difference. First operand 651 states and 936 transitions. Second operand 5 states. [2019-10-03 04:09:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,995 INFO L93 Difference]: Finished difference Result 720 states and 1022 transitions. [2019-10-03 04:09:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-03 04:09:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,999 INFO L225 Difference]: With dead ends: 720 [2019-10-03 04:09:12,999 INFO L226 Difference]: Without dead ends: 720 [2019-10-03 04:09:13,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-10-03 04:09:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 714. [2019-10-03 04:09:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-03 04:09:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2019-10-03 04:09:13,018 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 43 [2019-10-03 04:09:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,018 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2019-10-03 04:09:13,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2019-10-03 04:09:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 04:09:13,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,019 INFO L411 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-10-03 04:09:13,020 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 150670326, now seen corresponding path program 1 times [2019-10-03 04:09:13,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,061 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand 5 states. [2019-10-03 04:09:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,225 INFO L93 Difference]: Finished difference Result 742 states and 1054 transitions. [2019-10-03 04:09:13,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-03 04:09:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,229 INFO L225 Difference]: With dead ends: 742 [2019-10-03 04:09:13,229 INFO L226 Difference]: Without dead ends: 742 [2019-10-03 04:09:13,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-03 04:09:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 714. [2019-10-03 04:09:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-03 04:09:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1011 transitions. [2019-10-03 04:09:13,243 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1011 transitions. Word has length 44 [2019-10-03 04:09:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,244 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1011 transitions. [2019-10-03 04:09:13,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1011 transitions. [2019-10-03 04:09:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 04:09:13,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,245 INFO L411 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-10-03 04:09:13,245 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -826101582, now seen corresponding path program 1 times [2019-10-03 04:09:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,284 INFO L87 Difference]: Start difference. First operand 714 states and 1011 transitions. Second operand 5 states. [2019-10-03 04:09:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,462 INFO L93 Difference]: Finished difference Result 724 states and 1022 transitions. [2019-10-03 04:09:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-03 04:09:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,467 INFO L225 Difference]: With dead ends: 724 [2019-10-03 04:09:13,467 INFO L226 Difference]: Without dead ends: 724 [2019-10-03 04:09:13,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-03 04:09:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 718. [2019-10-03 04:09:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-03 04:09:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1017 transitions. [2019-10-03 04:09:13,482 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1017 transitions. Word has length 44 [2019-10-03 04:09:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,482 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1017 transitions. [2019-10-03 04:09:13,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1017 transitions. [2019-10-03 04:09:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 04:09:13,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,483 INFO L411 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-10-03 04:09:13,484 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 394900860, now seen corresponding path program 1 times [2019-10-03 04:09:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,522 INFO L87 Difference]: Start difference. First operand 718 states and 1017 transitions. Second operand 5 states. [2019-10-03 04:09:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,731 INFO L93 Difference]: Finished difference Result 787 states and 1101 transitions. [2019-10-03 04:09:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-03 04:09:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,735 INFO L225 Difference]: With dead ends: 787 [2019-10-03 04:09:13,735 INFO L226 Difference]: Without dead ends: 787 [2019-10-03 04:09:13,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-03 04:09:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2019-10-03 04:09:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-10-03 04:09:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1100 transitions. [2019-10-03 04:09:13,750 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1100 transitions. Word has length 45 [2019-10-03 04:09:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,750 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1100 transitions. [2019-10-03 04:09:13,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1100 transitions. [2019-10-03 04:09:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:09:13,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,751 INFO L411 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-10-03 04:09:13,752 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2061317727, now seen corresponding path program 1 times [2019-10-03 04:09:13,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,798 INFO L87 Difference]: Start difference. First operand 785 states and 1100 transitions. Second operand 5 states. [2019-10-03 04:09:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,000 INFO L93 Difference]: Finished difference Result 799 states and 1117 transitions. [2019-10-03 04:09:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-03 04:09:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,005 INFO L225 Difference]: With dead ends: 799 [2019-10-03 04:09:14,005 INFO L226 Difference]: Without dead ends: 799 [2019-10-03 04:09:14,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-03 04:09:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 789. [2019-10-03 04:09:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-03 04:09:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1106 transitions. [2019-10-03 04:09:14,019 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1106 transitions. Word has length 47 [2019-10-03 04:09:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,020 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1106 transitions. [2019-10-03 04:09:14,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1106 transitions. [2019-10-03 04:09:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:09:14,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,021 INFO L411 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-10-03 04:09:14,021 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2062397286, now seen corresponding path program 1 times [2019-10-03 04:09:14,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,058 INFO L87 Difference]: Start difference. First operand 789 states and 1106 transitions. Second operand 5 states. [2019-10-03 04:09:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,242 INFO L93 Difference]: Finished difference Result 884 states and 1234 transitions. [2019-10-03 04:09:14,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-03 04:09:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,249 INFO L225 Difference]: With dead ends: 884 [2019-10-03 04:09:14,249 INFO L226 Difference]: Without dead ends: 884 [2019-10-03 04:09:14,249 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-03 04:09:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 870. [2019-10-03 04:09:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-10-03 04:09:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1213 transitions. [2019-10-03 04:09:14,264 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1213 transitions. Word has length 47 [2019-10-03 04:09:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,264 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 1213 transitions. [2019-10-03 04:09:14,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1213 transitions. [2019-10-03 04:09:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 04:09:14,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,265 INFO L411 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-10-03 04:09:14,266 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1357130696, now seen corresponding path program 1 times [2019-10-03 04:09:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,303 INFO L87 Difference]: Start difference. First operand 870 states and 1213 transitions. Second operand 5 states. [2019-10-03 04:09:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,501 INFO L93 Difference]: Finished difference Result 882 states and 1224 transitions. [2019-10-03 04:09:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 04:09:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,507 INFO L225 Difference]: With dead ends: 882 [2019-10-03 04:09:14,507 INFO L226 Difference]: Without dead ends: 882 [2019-10-03 04:09:14,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-03 04:09:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2019-10-03 04:09:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-03 04:09:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1213 transitions. [2019-10-03 04:09:14,526 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1213 transitions. Word has length 48 [2019-10-03 04:09:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,526 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1213 transitions. [2019-10-03 04:09:14,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1213 transitions. [2019-10-03 04:09:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 04:09:14,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,528 INFO L411 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-10-03 04:09:14,530 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -393720600, now seen corresponding path program 1 times [2019-10-03 04:09:14,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,571 INFO L87 Difference]: Start difference. First operand 872 states and 1213 transitions. Second operand 5 states. [2019-10-03 04:09:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,756 INFO L93 Difference]: Finished difference Result 953 states and 1309 transitions. [2019-10-03 04:09:14,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 04:09:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,761 INFO L225 Difference]: With dead ends: 953 [2019-10-03 04:09:14,762 INFO L226 Difference]: Without dead ends: 953 [2019-10-03 04:09:14,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-10-03 04:09:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 947. [2019-10-03 04:09:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-10-03 04:09:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1304 transitions. [2019-10-03 04:09:14,778 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1304 transitions. Word has length 48 [2019-10-03 04:09:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,779 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1304 transitions. [2019-10-03 04:09:14,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1304 transitions. [2019-10-03 04:09:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 04:09:14,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,780 INFO L411 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-10-03 04:09:14,780 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1882441225, now seen corresponding path program 1 times [2019-10-03 04:09:14,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,821 INFO L87 Difference]: Start difference. First operand 947 states and 1304 transitions. Second operand 5 states. [2019-10-03 04:09:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,019 INFO L93 Difference]: Finished difference Result 971 states and 1343 transitions. [2019-10-03 04:09:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 04:09:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,025 INFO L225 Difference]: With dead ends: 971 [2019-10-03 04:09:15,025 INFO L226 Difference]: Without dead ends: 971 [2019-10-03 04:09:15,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-10-03 04:09:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 957. [2019-10-03 04:09:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-10-03 04:09:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1322 transitions. [2019-10-03 04:09:15,045 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1322 transitions. Word has length 48 [2019-10-03 04:09:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,046 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1322 transitions. [2019-10-03 04:09:15,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1322 transitions. [2019-10-03 04:09:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 04:09:15,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,047 INFO L411 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-10-03 04:09:15,048 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash -368829041, now seen corresponding path program 1 times [2019-10-03 04:09:15,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,095 INFO L87 Difference]: Start difference. First operand 957 states and 1322 transitions. Second operand 5 states. [2019-10-03 04:09:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,396 INFO L93 Difference]: Finished difference Result 963 states and 1323 transitions. [2019-10-03 04:09:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 04:09:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,400 INFO L225 Difference]: With dead ends: 963 [2019-10-03 04:09:15,400 INFO L226 Difference]: Without dead ends: 963 [2019-10-03 04:09:15,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-10-03 04:09:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 957. [2019-10-03 04:09:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-10-03 04:09:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1318 transitions. [2019-10-03 04:09:15,416 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1318 transitions. Word has length 49 [2019-10-03 04:09:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,416 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1318 transitions. [2019-10-03 04:09:15,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1318 transitions. [2019-10-03 04:09:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 04:09:15,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,417 INFO L411 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-10-03 04:09:15,417 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267133, now seen corresponding path program 1 times [2019-10-03 04:09:15,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,489 INFO L87 Difference]: Start difference. First operand 957 states and 1318 transitions. Second operand 5 states. [2019-10-03 04:09:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,675 INFO L93 Difference]: Finished difference Result 1040 states and 1414 transitions. [2019-10-03 04:09:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-03 04:09:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,680 INFO L225 Difference]: With dead ends: 1040 [2019-10-03 04:09:15,680 INFO L226 Difference]: Without dead ends: 1040 [2019-10-03 04:09:15,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-10-03 04:09:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-10-03 04:09:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-03 04:09:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1409 transitions. [2019-10-03 04:09:15,695 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1409 transitions. Word has length 50 [2019-10-03 04:09:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,695 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1409 transitions. [2019-10-03 04:09:15,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1409 transitions. [2019-10-03 04:09:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 04:09:15,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,696 INFO L411 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-10-03 04:09:15,697 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 36294858, now seen corresponding path program 1 times [2019-10-03 04:09:15,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,740 INFO L87 Difference]: Start difference. First operand 1034 states and 1409 transitions. Second operand 5 states. [2019-10-03 04:09:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,939 INFO L93 Difference]: Finished difference Result 1040 states and 1410 transitions. [2019-10-03 04:09:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-03 04:09:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,946 INFO L225 Difference]: With dead ends: 1040 [2019-10-03 04:09:15,946 INFO L226 Difference]: Without dead ends: 1040 [2019-10-03 04:09:15,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-10-03 04:09:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-10-03 04:09:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-03 04:09:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1405 transitions. [2019-10-03 04:09:15,960 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1405 transitions. Word has length 51 [2019-10-03 04:09:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,961 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1405 transitions. [2019-10-03 04:09:15,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1405 transitions. [2019-10-03 04:09:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 04:09:15,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,962 INFO L411 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-10-03 04:09:15,963 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1896340220, now seen corresponding path program 1 times [2019-10-03 04:09:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:15,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:15,987 INFO L87 Difference]: Start difference. First operand 1034 states and 1405 transitions. Second operand 3 states. [2019-10-03 04:09:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,991 INFO L93 Difference]: Finished difference Result 1034 states and 1378 transitions. [2019-10-03 04:09:15,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:15,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-03 04:09:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,996 INFO L225 Difference]: With dead ends: 1034 [2019-10-03 04:09:15,996 INFO L226 Difference]: Without dead ends: 1034 [2019-10-03 04:09:15,998 INFO L640 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-10-03 04:09:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-10-03 04:09:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-10-03 04:09:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-03 04:09:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1378 transitions. [2019-10-03 04:09:16,013 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1378 transitions. Word has length 54 [2019-10-03 04:09:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,013 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1378 transitions. [2019-10-03 04:09:16,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1378 transitions. [2019-10-03 04:09:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 04:09:16,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,015 INFO L411 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-10-03 04:09:16,015 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1048271307, now seen corresponding path program 1 times [2019-10-03 04:09:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:16,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:16,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:16,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:16,048 INFO L87 Difference]: Start difference. First operand 1034 states and 1378 transitions. Second operand 3 states. [2019-10-03 04:09:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,067 INFO L93 Difference]: Finished difference Result 1052 states and 1375 transitions. [2019-10-03 04:09:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:16,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-03 04:09:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,071 INFO L225 Difference]: With dead ends: 1052 [2019-10-03 04:09:16,072 INFO L226 Difference]: Without dead ends: 1052 [2019-10-03 04:09:16,073 INFO L640 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-10-03 04:09:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-03 04:09:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-10-03 04:09:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-03 04:09:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1369 transitions. [2019-10-03 04:09:16,087 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1369 transitions. Word has length 55 [2019-10-03 04:09:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,087 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1369 transitions. [2019-10-03 04:09:16,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1369 transitions. [2019-10-03 04:09:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 04:09:16,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,088 INFO L411 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-10-03 04:09:16,089 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1564495280, now seen corresponding path program 1 times [2019-10-03 04:09:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,138 INFO L87 Difference]: Start difference. First operand 1046 states and 1369 transitions. Second operand 5 states. [2019-10-03 04:09:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,352 INFO L93 Difference]: Finished difference Result 1143 states and 1469 transitions. [2019-10-03 04:09:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-03 04:09:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,359 INFO L225 Difference]: With dead ends: 1143 [2019-10-03 04:09:16,359 INFO L226 Difference]: Without dead ends: 1143 [2019-10-03 04:09:16,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-10-03 04:09:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1131. [2019-10-03 04:09:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-10-03 04:09:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1451 transitions. [2019-10-03 04:09:16,375 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1451 transitions. Word has length 57 [2019-10-03 04:09:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,376 INFO L475 AbstractCegarLoop]: Abstraction has 1131 states and 1451 transitions. [2019-10-03 04:09:16,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1451 transitions. [2019-10-03 04:09:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 04:09:16,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,377 INFO L411 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-10-03 04:09:16,377 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -928520343, now seen corresponding path program 1 times [2019-10-03 04:09:16,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,415 INFO L87 Difference]: Start difference. First operand 1131 states and 1451 transitions. Second operand 5 states. [2019-10-03 04:09:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,630 INFO L93 Difference]: Finished difference Result 1149 states and 1475 transitions. [2019-10-03 04:09:16,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-03 04:09:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,636 INFO L225 Difference]: With dead ends: 1149 [2019-10-03 04:09:16,636 INFO L226 Difference]: Without dead ends: 1149 [2019-10-03 04:09:16,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-10-03 04:09:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1135. [2019-10-03 04:09:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-10-03 04:09:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1456 transitions. [2019-10-03 04:09:16,647 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1456 transitions. Word has length 58 [2019-10-03 04:09:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,647 INFO L475 AbstractCegarLoop]: Abstraction has 1135 states and 1456 transitions. [2019-10-03 04:09:16,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1456 transitions. [2019-10-03 04:09:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 04:09:16,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,651 INFO L411 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-10-03 04:09:16,651 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 332165990, now seen corresponding path program 1 times [2019-10-03 04:09:16,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,694 INFO L87 Difference]: Start difference. First operand 1135 states and 1456 transitions. Second operand 5 states. [2019-10-03 04:09:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,891 INFO L93 Difference]: Finished difference Result 1236 states and 1573 transitions. [2019-10-03 04:09:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-03 04:09:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,900 INFO L225 Difference]: With dead ends: 1236 [2019-10-03 04:09:16,900 INFO L226 Difference]: Without dead ends: 1236 [2019-10-03 04:09:16,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-03 04:09:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1224. [2019-10-03 04:09:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-10-03 04:09:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1556 transitions. [2019-10-03 04:09:16,914 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1556 transitions. Word has length 59 [2019-10-03 04:09:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,914 INFO L475 AbstractCegarLoop]: Abstraction has 1224 states and 1556 transitions. [2019-10-03 04:09:16,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1556 transitions. [2019-10-03 04:09:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:09:16,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,915 INFO L411 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-10-03 04:09:16,915 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1890648705, now seen corresponding path program 1 times [2019-10-03 04:09:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:16,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:16,938 INFO L87 Difference]: Start difference. First operand 1224 states and 1556 transitions. Second operand 3 states. [2019-10-03 04:09:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,956 INFO L93 Difference]: Finished difference Result 2420 states and 3051 transitions. [2019-10-03 04:09:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:16,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:09:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,966 INFO L225 Difference]: With dead ends: 2420 [2019-10-03 04:09:16,966 INFO L226 Difference]: Without dead ends: 2420 [2019-10-03 04:09:16,966 INFO L640 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-10-03 04:09:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-10-03 04:09:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1840. [2019-10-03 04:09:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-10-03 04:09:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2331 transitions. [2019-10-03 04:09:16,989 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2331 transitions. Word has length 60 [2019-10-03 04:09:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,989 INFO L475 AbstractCegarLoop]: Abstraction has 1840 states and 2331 transitions. [2019-10-03 04:09:16,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2331 transitions. [2019-10-03 04:09:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:09:16,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,991 INFO L411 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-10-03 04:09:16,991 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1918883551, now seen corresponding path program 1 times [2019-10-03 04:09:16,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,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-10-03 04:09:17,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,026 INFO L87 Difference]: Start difference. First operand 1840 states and 2331 transitions. Second operand 5 states. [2019-10-03 04:09:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,231 INFO L93 Difference]: Finished difference Result 1863 states and 2362 transitions. [2019-10-03 04:09:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 04:09:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,243 INFO L225 Difference]: With dead ends: 1863 [2019-10-03 04:09:17,243 INFO L226 Difference]: Without dead ends: 1788 [2019-10-03 04:09:17,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-03 04:09:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1771. [2019-10-03 04:09:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-03 04:09:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2226 transitions. [2019-10-03 04:09:17,269 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2226 transitions. Word has length 60 [2019-10-03 04:09:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,269 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2226 transitions. [2019-10-03 04:09:17,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2226 transitions. [2019-10-03 04:09:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:09:17,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,271 INFO L411 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-10-03 04:09:17,271 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1409568447, now seen corresponding path program 1 times [2019-10-03 04:09:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 04:09:17,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:17,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:17,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:17,299 INFO L87 Difference]: Start difference. First operand 1771 states and 2226 transitions. Second operand 3 states. [2019-10-03 04:09:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,445 INFO L93 Difference]: Finished difference Result 1789 states and 2248 transitions. [2019-10-03 04:09:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:17,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:09:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,450 INFO L225 Difference]: With dead ends: 1789 [2019-10-03 04:09:17,450 INFO L226 Difference]: Without dead ends: 1789 [2019-10-03 04:09:17,450 INFO L640 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-10-03 04:09:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-10-03 04:09:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1771. [2019-10-03 04:09:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-03 04:09:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2221 transitions. [2019-10-03 04:09:17,468 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2221 transitions. Word has length 60 [2019-10-03 04:09:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,468 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2221 transitions. [2019-10-03 04:09:17,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2221 transitions. [2019-10-03 04:09:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:09:17,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,470 INFO L411 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-10-03 04:09:17,470 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2089626817, now seen corresponding path program 1 times [2019-10-03 04:09:17,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 04:09:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:17,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:17,507 INFO L87 Difference]: Start difference. First operand 1771 states and 2221 transitions. Second operand 3 states. [2019-10-03 04:09:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,519 INFO L93 Difference]: Finished difference Result 2328 states and 2890 transitions. [2019-10-03 04:09:17,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:17,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:09:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,524 INFO L225 Difference]: With dead ends: 2328 [2019-10-03 04:09:17,524 INFO L226 Difference]: Without dead ends: 2328 [2019-10-03 04:09:17,524 INFO L640 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-10-03 04:09:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-10-03 04:09:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1763. [2019-10-03 04:09:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-10-03 04:09:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2196 transitions. [2019-10-03 04:09:17,542 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2196 transitions. Word has length 60 [2019-10-03 04:09:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,543 INFO L475 AbstractCegarLoop]: Abstraction has 1763 states and 2196 transitions. [2019-10-03 04:09:17,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2196 transitions. [2019-10-03 04:09:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 04:09:17,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,544 INFO L411 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-10-03 04:09:17,544 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1796569389, now seen corresponding path program 1 times [2019-10-03 04:09:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:17,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:17,593 INFO L87 Difference]: Start difference. First operand 1763 states and 2196 transitions. Second operand 3 states. [2019-10-03 04:09:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,611 INFO L93 Difference]: Finished difference Result 3472 states and 4240 transitions. [2019-10-03 04:09:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:17,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-03 04:09:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,618 INFO L225 Difference]: With dead ends: 3472 [2019-10-03 04:09:17,618 INFO L226 Difference]: Without dead ends: 3472 [2019-10-03 04:09:17,618 INFO L640 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-10-03 04:09:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-10-03 04:09:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2019-10-03 04:09:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3470 states. [2019-10-03 04:09:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4239 transitions. [2019-10-03 04:09:17,653 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4239 transitions. Word has length 61 [2019-10-03 04:09:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,654 INFO L475 AbstractCegarLoop]: Abstraction has 3470 states and 4239 transitions. [2019-10-03 04:09:17,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4239 transitions. [2019-10-03 04:09:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 04:09:17,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,656 INFO L411 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-10-03 04:09:17,657 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425408, now seen corresponding path program 1 times [2019-10-03 04:09:17,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:09:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:09:17,727 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 04:09:17,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:09:17 BoogieIcfgContainer [2019-10-03 04:09:17,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:09:17,814 INFO L168 Benchmark]: Toolchain (without parser) took 12456.40 ms. Allocated memory was 131.1 MB in the beginning and 445.6 MB in the end (delta: 314.6 MB). Free memory was 86.5 MB in the beginning and 107.4 MB in the end (delta: -20.9 MB). Peak memory consumption was 293.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:17,815 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 04:09:17,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.96 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 86.0 MB in the beginning and 171.1 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:17,816 INFO L168 Benchmark]: Boogie Preprocessor took 60.49 ms. Allocated memory is still 198.7 MB. Free memory was 171.1 MB in the beginning and 169.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:17,817 INFO L168 Benchmark]: RCFGBuilder took 920.43 ms. Allocated memory is still 198.7 MB. Free memory was 169.2 MB in the beginning and 115.4 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:17,818 INFO L168 Benchmark]: TraceAbstraction took 10941.66 ms. Allocated memory was 198.7 MB in the beginning and 445.6 MB in the end (delta: 246.9 MB). Free memory was 115.4 MB in the beginning and 107.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 255.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:17,823 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.23 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 528.96 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 86.0 MB in the beginning and 171.1 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.49 ms. Allocated memory is still 198.7 MB. Free memory was 171.1 MB in the beginning and 169.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 920.43 ms. Allocated memory is still 198.7 MB. Free memory was 169.2 MB in the beginning and 115.4 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10941.66 ms. Allocated memory was 198.7 MB in the beginning and 445.6 MB in the end (delta: 246.9 MB). Free memory was 115.4 MB in the beginning and 107.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 255.0 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. UNSAFE Result, 10.8s OverallTime, 42 OverallIterations, 2 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7582 SDtfs, 15139 SDslu, 7637 SDs, 0 SdLazy, 5353 SolverSat, 1506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 1597 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...