java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:50,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:50,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:50,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:50,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:50,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:50,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:50,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:50,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:50,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:50,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:50,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:50,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:50,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:50,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:50,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:50,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:50,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:50,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:50,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:50,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:50,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:50,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:50,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:50,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:50,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:50,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:50,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:50,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:50,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:50,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:50,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:50,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:50,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:50,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:50,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:50,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:50,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:50,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:50,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:50,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:50,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:50,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:50,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:50,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:50,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:50,848 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:50,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:50,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:50,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:50,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:50,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:50,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:50,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:50,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:50,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:50,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:50,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:50,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:50,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:50,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:50,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:50,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:50,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:50,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:50,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:50,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:50,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:50,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:50,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:50,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:51,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:51,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:51,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:51,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:51,160 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:51,161 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-15 01:27:51,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44396f2dc/cdf9e3d2da6a4fa09c7840a21752ce10/FLAGebaa97420 [2019-10-15 01:27:51,791 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:51,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-10-15 01:27:51,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44396f2dc/cdf9e3d2da6a4fa09c7840a21752ce10/FLAGebaa97420 [2019-10-15 01:27:52,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44396f2dc/cdf9e3d2da6a4fa09c7840a21752ce10 [2019-10-15 01:27:52,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:52,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:52,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:52,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:52,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:52,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596ca61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52, skipping insertion in model container [2019-10-15 01:27:52,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:52,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:52,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:52,502 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:52,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:52,708 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:52,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52 WrapperNode [2019-10-15 01:27:52,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:52,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:52,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:52,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:52,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... [2019-10-15 01:27:52,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:52,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:52,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:52,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:52,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:52,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:27:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:52,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:52,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:27:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:52,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:52,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:53,098 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:53,632 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:27:53,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:27:53,637 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:53,638 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:53,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:53 BoogieIcfgContainer [2019-10-15 01:27:53,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:53,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:53,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:53,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:53,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:52" (1/3) ... [2019-10-15 01:27:53,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5ab151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:53, skipping insertion in model container [2019-10-15 01:27:53,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:52" (2/3) ... [2019-10-15 01:27:53,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5ab151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:53, skipping insertion in model container [2019-10-15 01:27:53,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:53" (3/3) ... [2019-10-15 01:27:53,666 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-10-15 01:27:53,679 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:53,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:53,704 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:53,745 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:53,745 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:53,745 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:53,746 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:53,746 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:53,746 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:53,746 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:53,746 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-10-15 01:27:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:27:53,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:53,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:53,798 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2138433857, now seen corresponding path program 1 times [2019-10-15 01:27:53,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:53,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884729258] [2019-10-15 01:27:53,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:54,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884729258] [2019-10-15 01:27:54,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:54,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:54,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068323905] [2019-10-15 01:27:54,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:54,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:54,145 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 5 states. [2019-10-15 01:27:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,600 INFO L93 Difference]: Finished difference Result 333 states and 566 transitions. [2019-10-15 01:27:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:54,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-15 01:27:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,634 INFO L225 Difference]: With dead ends: 333 [2019-10-15 01:27:54,635 INFO L226 Difference]: Without dead ends: 166 [2019-10-15 01:27:54,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-15 01:27:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-10-15 01:27:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-15 01:27:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2019-10-15 01:27:54,762 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 28 [2019-10-15 01:27:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:54,762 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2019-10-15 01:27:54,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2019-10-15 01:27:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:54,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:54,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:54,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1059341068, now seen corresponding path program 1 times [2019-10-15 01:27:54,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:54,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616884347] [2019-10-15 01:27:54,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:54,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616884347] [2019-10-15 01:27:54,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:54,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:54,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934047643] [2019-10-15 01:27:54,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:54,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:54,914 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand 5 states. [2019-10-15 01:27:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,177 INFO L93 Difference]: Finished difference Result 336 states and 528 transitions. [2019-10-15 01:27:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:55,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-15 01:27:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,180 INFO L225 Difference]: With dead ends: 336 [2019-10-15 01:27:55,180 INFO L226 Difference]: Without dead ends: 187 [2019-10-15 01:27:55,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-15 01:27:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-10-15 01:27:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-15 01:27:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2019-10-15 01:27:55,198 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 29 [2019-10-15 01:27:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,199 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2019-10-15 01:27:55,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2019-10-15 01:27:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:55,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,201 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash -947080425, now seen corresponding path program 1 times [2019-10-15 01:27:55,203 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462022450] [2019-10-15 01:27:55,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:55,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462022450] [2019-10-15 01:27:55,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:55,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:55,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951689685] [2019-10-15 01:27:55,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:55,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,328 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand 5 states. [2019-10-15 01:27:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,580 INFO L93 Difference]: Finished difference Result 367 states and 572 transitions. [2019-10-15 01:27:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:55,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-15 01:27:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,585 INFO L225 Difference]: With dead ends: 367 [2019-10-15 01:27:55,586 INFO L226 Difference]: Without dead ends: 195 [2019-10-15 01:27:55,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-15 01:27:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-10-15 01:27:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-15 01:27:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2019-10-15 01:27:55,626 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 29 [2019-10-15 01:27:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,626 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2019-10-15 01:27:55,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2019-10-15 01:27:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:55,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,628 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 837081432, now seen corresponding path program 1 times [2019-10-15 01:27:55,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590497966] [2019-10-15 01:27:55,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:55,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590497966] [2019-10-15 01:27:55,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:55,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:55,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672922621] [2019-10-15 01:27:55,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:55,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,743 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand 5 states. [2019-10-15 01:27:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,955 INFO L93 Difference]: Finished difference Result 372 states and 582 transitions. [2019-10-15 01:27:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:55,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-15 01:27:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,958 INFO L225 Difference]: With dead ends: 372 [2019-10-15 01:27:55,958 INFO L226 Difference]: Without dead ends: 194 [2019-10-15 01:27:55,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-15 01:27:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-10-15 01:27:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-15 01:27:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 299 transitions. [2019-10-15 01:27:55,971 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 299 transitions. Word has length 29 [2019-10-15 01:27:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,972 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 299 transitions. [2019-10-15 01:27:55,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 299 transitions. [2019-10-15 01:27:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:27:55,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,974 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2002433700, now seen corresponding path program 1 times [2019-10-15 01:27:55,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727298591] [2019-10-15 01:27:55,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:56,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727298591] [2019-10-15 01:27:56,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:56,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420759811] [2019-10-15 01:27:56,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:56,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,057 INFO L87 Difference]: Start difference. First operand 192 states and 299 transitions. Second operand 5 states. [2019-10-15 01:27:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,255 INFO L93 Difference]: Finished difference Result 383 states and 594 transitions. [2019-10-15 01:27:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 01:27:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,261 INFO L225 Difference]: With dead ends: 383 [2019-10-15 01:27:56,261 INFO L226 Difference]: Without dead ends: 204 [2019-10-15 01:27:56,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-15 01:27:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-15 01:27:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-15 01:27:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 297 transitions. [2019-10-15 01:27:56,277 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 297 transitions. Word has length 30 [2019-10-15 01:27:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,278 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 297 transitions. [2019-10-15 01:27:56,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 297 transitions. [2019-10-15 01:27:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:27:56,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,280 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 533516532, now seen corresponding path program 1 times [2019-10-15 01:27:56,281 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916151967] [2019-10-15 01:27:56,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:56,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916151967] [2019-10-15 01:27:56,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:56,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219702796] [2019-10-15 01:27:56,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:56,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,383 INFO L87 Difference]: Start difference. First operand 192 states and 297 transitions. Second operand 5 states. [2019-10-15 01:27:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,575 INFO L93 Difference]: Finished difference Result 383 states and 590 transitions. [2019-10-15 01:27:56,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-15 01:27:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,577 INFO L225 Difference]: With dead ends: 383 [2019-10-15 01:27:56,577 INFO L226 Difference]: Without dead ends: 204 [2019-10-15 01:27:56,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-15 01:27:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-15 01:27:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-15 01:27:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2019-10-15 01:27:56,589 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 31 [2019-10-15 01:27:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,590 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2019-10-15 01:27:56,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2019-10-15 01:27:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:27:56,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,592 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -714108489, now seen corresponding path program 1 times [2019-10-15 01:27:56,592 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710644891] [2019-10-15 01:27:56,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:56,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710644891] [2019-10-15 01:27:56,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:56,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128756493] [2019-10-15 01:27:56,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:56,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,640 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand 5 states. [2019-10-15 01:27:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,849 INFO L93 Difference]: Finished difference Result 383 states and 586 transitions. [2019-10-15 01:27:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-15 01:27:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,851 INFO L225 Difference]: With dead ends: 383 [2019-10-15 01:27:56,851 INFO L226 Difference]: Without dead ends: 204 [2019-10-15 01:27:56,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-15 01:27:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-10-15 01:27:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-15 01:27:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2019-10-15 01:27:56,864 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 32 [2019-10-15 01:27:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,864 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-10-15 01:27:56,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2019-10-15 01:27:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:27:56,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 522773526, now seen corresponding path program 1 times [2019-10-15 01:27:56,867 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640777617] [2019-10-15 01:27:56,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:56,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640777617] [2019-10-15 01:27:56,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428560459] [2019-10-15 01:27:56,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,899 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand 3 states. [2019-10-15 01:27:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,924 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2019-10-15 01:27:56,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:27:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,928 INFO L225 Difference]: With dead ends: 542 [2019-10-15 01:27:56,928 INFO L226 Difference]: Without dead ends: 363 [2019-10-15 01:27:56,929 INFO L600 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-15 01:27:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-15 01:27:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-10-15 01:27:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-15 01:27:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-10-15 01:27:56,949 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 32 [2019-10-15 01:27:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,950 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-10-15 01:27:56,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-10-15 01:27:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:27:56,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,952 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1890290600, now seen corresponding path program 1 times [2019-10-15 01:27:56,953 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580258364] [2019-10-15 01:27:56,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:57,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580258364] [2019-10-15 01:27:57,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:27:57,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771448490] [2019-10-15 01:27:57,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:27:57,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:27:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:27:57,012 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-10-15 01:27:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,194 INFO L93 Difference]: Finished difference Result 437 states and 658 transitions. [2019-10-15 01:27:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:27:57,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-10-15 01:27:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,197 INFO L225 Difference]: With dead ends: 437 [2019-10-15 01:27:57,198 INFO L226 Difference]: Without dead ends: 435 [2019-10-15 01:27:57,198 INFO L600 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-15 01:27:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-15 01:27:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 370. [2019-10-15 01:27:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:27:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2019-10-15 01:27:57,221 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 33 [2019-10-15 01:27:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,221 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2019-10-15 01:27:57,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:27:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2019-10-15 01:27:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:27:57,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:57,223 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -784025939, now seen corresponding path program 1 times [2019-10-15 01:27:57,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627842216] [2019-10-15 01:27:57,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:57,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627842216] [2019-10-15 01:27:57,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:57,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626514900] [2019-10-15 01:27:57,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:57,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:57,269 INFO L87 Difference]: Start difference. First operand 370 states and 563 transitions. Second operand 5 states. [2019-10-15 01:27:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,532 INFO L93 Difference]: Finished difference Result 748 states and 1133 transitions. [2019-10-15 01:27:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:57,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-15 01:27:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,536 INFO L225 Difference]: With dead ends: 748 [2019-10-15 01:27:57,536 INFO L226 Difference]: Without dead ends: 392 [2019-10-15 01:27:57,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-15 01:27:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 370. [2019-10-15 01:27:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:27:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2019-10-15 01:27:57,563 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 34 [2019-10-15 01:27:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2019-10-15 01:27:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2019-10-15 01:27:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:27:57,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:57,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,567 INFO L82 PathProgramCache]: Analyzing trace with hash -48568943, now seen corresponding path program 1 times [2019-10-15 01:27:57,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031101599] [2019-10-15 01:27:57,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:57,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031101599] [2019-10-15 01:27:57,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:57,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577274760] [2019-10-15 01:27:57,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:57,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:57,617 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand 5 states. [2019-10-15 01:27:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,815 INFO L93 Difference]: Finished difference Result 738 states and 1117 transitions. [2019-10-15 01:27:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:57,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-15 01:27:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,818 INFO L225 Difference]: With dead ends: 738 [2019-10-15 01:27:57,818 INFO L226 Difference]: Without dead ends: 382 [2019-10-15 01:27:57,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-15 01:27:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-10-15 01:27:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:27:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 565 transitions. [2019-10-15 01:27:57,841 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 565 transitions. Word has length 34 [2019-10-15 01:27:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,841 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 565 transitions. [2019-10-15 01:27:57,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 565 transitions. [2019-10-15 01:27:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:27:57,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:57,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 815405373, now seen corresponding path program 1 times [2019-10-15 01:27:57,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140330113] [2019-10-15 01:27:57,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:57,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140330113] [2019-10-15 01:27:57,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:57,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739631831] [2019-10-15 01:27:57,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:57,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:57,908 INFO L87 Difference]: Start difference. First operand 374 states and 565 transitions. Second operand 5 states. [2019-10-15 01:27:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,116 INFO L93 Difference]: Finished difference Result 787 states and 1184 transitions. [2019-10-15 01:27:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:58,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-15 01:27:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,120 INFO L225 Difference]: With dead ends: 787 [2019-10-15 01:27:58,121 INFO L226 Difference]: Without dead ends: 427 [2019-10-15 01:27:58,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-15 01:27:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2019-10-15 01:27:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-15 01:27:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 626 transitions. [2019-10-15 01:27:58,148 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 626 transitions. Word has length 35 [2019-10-15 01:27:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,148 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 626 transitions. [2019-10-15 01:27:58,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 626 transitions. [2019-10-15 01:27:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:27:58,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,151 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,151 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1933074875, now seen corresponding path program 1 times [2019-10-15 01:27:58,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692213468] [2019-10-15 01:27:58,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:58,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692213468] [2019-10-15 01:27:58,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:58,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:58,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144898088] [2019-10-15 01:27:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:58,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:58,229 INFO L87 Difference]: Start difference. First operand 419 states and 626 transitions. Second operand 5 states. [2019-10-15 01:27:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,460 INFO L93 Difference]: Finished difference Result 883 states and 1316 transitions. [2019-10-15 01:27:58,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:58,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:27:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,464 INFO L225 Difference]: With dead ends: 883 [2019-10-15 01:27:58,464 INFO L226 Difference]: Without dead ends: 478 [2019-10-15 01:27:58,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-15 01:27:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2019-10-15 01:27:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-15 01:27:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2019-10-15 01:27:58,495 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 38 [2019-10-15 01:27:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,496 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2019-10-15 01:27:58,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2019-10-15 01:27:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:27:58,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1841800743, now seen corresponding path program 1 times [2019-10-15 01:27:58,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008955162] [2019-10-15 01:27:58,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:58,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008955162] [2019-10-15 01:27:58,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:58,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:58,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028609259] [2019-10-15 01:27:58,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:58,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:58,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:58,550 INFO L87 Difference]: Start difference. First operand 468 states and 693 transitions. Second operand 5 states. [2019-10-15 01:27:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,759 INFO L93 Difference]: Finished difference Result 987 states and 1456 transitions. [2019-10-15 01:27:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:58,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:27:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,763 INFO L225 Difference]: With dead ends: 987 [2019-10-15 01:27:58,763 INFO L226 Difference]: Without dead ends: 533 [2019-10-15 01:27:58,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-15 01:27:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 523. [2019-10-15 01:27:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-15 01:27:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 768 transitions. [2019-10-15 01:27:58,794 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 768 transitions. Word has length 38 [2019-10-15 01:27:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,795 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 768 transitions. [2019-10-15 01:27:58,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 768 transitions. [2019-10-15 01:27:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:27:58,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,797 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -416177979, now seen corresponding path program 1 times [2019-10-15 01:27:58,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146548766] [2019-10-15 01:27:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:58,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146548766] [2019-10-15 01:27:58,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:58,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:58,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514882210] [2019-10-15 01:27:58,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:58,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:58,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:58,839 INFO L87 Difference]: Start difference. First operand 523 states and 768 transitions. Second operand 5 states. [2019-10-15 01:27:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,046 INFO L93 Difference]: Finished difference Result 1048 states and 1541 transitions. [2019-10-15 01:27:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-15 01:27:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,050 INFO L225 Difference]: With dead ends: 1048 [2019-10-15 01:27:59,050 INFO L226 Difference]: Without dead ends: 539 [2019-10-15 01:27:59,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-10-15 01:27:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-10-15 01:27:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-15 01:27:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2019-10-15 01:27:59,080 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 39 [2019-10-15 01:27:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,081 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2019-10-15 01:27:59,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2019-10-15 01:27:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:27:59,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:59,083 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -758043503, now seen corresponding path program 1 times [2019-10-15 01:27:59,083 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:59,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213337096] [2019-10-15 01:27:59,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:59,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213337096] [2019-10-15 01:27:59,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:59,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:59,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120884499] [2019-10-15 01:27:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:59,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:59,142 INFO L87 Difference]: Start difference. First operand 529 states and 778 transitions. Second operand 5 states. [2019-10-15 01:27:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,374 INFO L93 Difference]: Finished difference Result 1054 states and 1551 transitions. [2019-10-15 01:27:59,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-15 01:27:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,378 INFO L225 Difference]: With dead ends: 1054 [2019-10-15 01:27:59,378 INFO L226 Difference]: Without dead ends: 539 [2019-10-15 01:27:59,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-10-15 01:27:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-10-15 01:27:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-15 01:27:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 774 transitions. [2019-10-15 01:27:59,409 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 774 transitions. Word has length 39 [2019-10-15 01:27:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,410 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 774 transitions. [2019-10-15 01:27:59,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 774 transitions. [2019-10-15 01:27:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:27:59,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:59,412 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -342748957, now seen corresponding path program 1 times [2019-10-15 01:27:59,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:59,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849032497] [2019-10-15 01:27:59,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:59,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849032497] [2019-10-15 01:27:59,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:59,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:59,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651526142] [2019-10-15 01:27:59,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:59,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:59,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:59,460 INFO L87 Difference]: Start difference. First operand 529 states and 774 transitions. Second operand 5 states. [2019-10-15 01:27:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,675 INFO L93 Difference]: Finished difference Result 1121 states and 1638 transitions. [2019-10-15 01:27:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 01:27:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,679 INFO L225 Difference]: With dead ends: 1121 [2019-10-15 01:27:59,680 INFO L226 Difference]: Without dead ends: 606 [2019-10-15 01:27:59,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-15 01:27:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2019-10-15 01:27:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-15 01:27:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 853 transitions. [2019-10-15 01:27:59,712 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 853 transitions. Word has length 40 [2019-10-15 01:27:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,712 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 853 transitions. [2019-10-15 01:27:59,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 853 transitions. [2019-10-15 01:27:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:27:59,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,714 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:59,714 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1593154033, now seen corresponding path program 1 times [2019-10-15 01:27:59,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:59,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398986611] [2019-10-15 01:27:59,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:59,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398986611] [2019-10-15 01:27:59,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:59,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:59,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520448181] [2019-10-15 01:27:59,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:59,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:59,757 INFO L87 Difference]: Start difference. First operand 588 states and 853 transitions. Second operand 5 states. [2019-10-15 01:27:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,990 INFO L93 Difference]: Finished difference Result 1188 states and 1731 transitions. [2019-10-15 01:27:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 01:27:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,994 INFO L225 Difference]: With dead ends: 1188 [2019-10-15 01:27:59,995 INFO L226 Difference]: Without dead ends: 614 [2019-10-15 01:27:59,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-15 01:28:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2019-10-15 01:28:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-15 01:28:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 867 transitions. [2019-10-15 01:28:00,033 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 867 transitions. Word has length 41 [2019-10-15 01:28:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,034 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 867 transitions. [2019-10-15 01:28:00,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 867 transitions. [2019-10-15 01:28:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:28:00,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,036 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash -104670206, now seen corresponding path program 1 times [2019-10-15 01:28:00,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191901354] [2019-10-15 01:28:00,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:00,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191901354] [2019-10-15 01:28:00,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:00,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:00,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007399861] [2019-10-15 01:28:00,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:00,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:00,085 INFO L87 Difference]: Start difference. First operand 596 states and 867 transitions. Second operand 5 states. [2019-10-15 01:28:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,335 INFO L93 Difference]: Finished difference Result 1261 states and 1832 transitions. [2019-10-15 01:28:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:00,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 01:28:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,340 INFO L225 Difference]: With dead ends: 1261 [2019-10-15 01:28:00,340 INFO L226 Difference]: Without dead ends: 679 [2019-10-15 01:28:00,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-10-15 01:28:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 651. [2019-10-15 01:28:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:28:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 936 transitions. [2019-10-15 01:28:00,376 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 936 transitions. Word has length 43 [2019-10-15 01:28:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 936 transitions. [2019-10-15 01:28:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 936 transitions. [2019-10-15 01:28:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:28:00,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,378 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,379 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1117549054, now seen corresponding path program 1 times [2019-10-15 01:28:00,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356789006] [2019-10-15 01:28:00,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:00,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356789006] [2019-10-15 01:28:00,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:00,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:00,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137766163] [2019-10-15 01:28:00,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:00,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:00,419 INFO L87 Difference]: Start difference. First operand 651 states and 936 transitions. Second operand 5 states. [2019-10-15 01:28:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,640 INFO L93 Difference]: Finished difference Result 1357 states and 1942 transitions. [2019-10-15 01:28:00,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:00,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 01:28:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,644 INFO L225 Difference]: With dead ends: 1357 [2019-10-15 01:28:00,644 INFO L226 Difference]: Without dead ends: 720 [2019-10-15 01:28:00,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-10-15 01:28:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 714. [2019-10-15 01:28:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-15 01:28:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2019-10-15 01:28:00,686 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 43 [2019-10-15 01:28:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,687 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2019-10-15 01:28:00,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2019-10-15 01:28:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:28:00,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,689 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 150670326, now seen corresponding path program 1 times [2019-10-15 01:28:00,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655824220] [2019-10-15 01:28:00,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:00,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655824220] [2019-10-15 01:28:00,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:00,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:00,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19653234] [2019-10-15 01:28:00,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:00,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:00,732 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand 5 states. [2019-10-15 01:28:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,973 INFO L93 Difference]: Finished difference Result 1442 states and 2059 transitions. [2019-10-15 01:28:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:00,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 01:28:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,979 INFO L225 Difference]: With dead ends: 1442 [2019-10-15 01:28:00,979 INFO L226 Difference]: Without dead ends: 742 [2019-10-15 01:28:00,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-15 01:28:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 714. [2019-10-15 01:28:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-15 01:28:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1011 transitions. [2019-10-15 01:28:01,028 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1011 transitions. Word has length 44 [2019-10-15 01:28:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,028 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1011 transitions. [2019-10-15 01:28:01,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1011 transitions. [2019-10-15 01:28:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:28:01,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:01,030 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -826101582, now seen corresponding path program 1 times [2019-10-15 01:28:01,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:01,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545323685] [2019-10-15 01:28:01,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:01,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545323685] [2019-10-15 01:28:01,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:01,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:01,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113780618] [2019-10-15 01:28:01,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:01,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,073 INFO L87 Difference]: Start difference. First operand 714 states and 1011 transitions. Second operand 5 states. [2019-10-15 01:28:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,316 INFO L93 Difference]: Finished difference Result 1424 states and 2017 transitions. [2019-10-15 01:28:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:01,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 01:28:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,322 INFO L225 Difference]: With dead ends: 1424 [2019-10-15 01:28:01,322 INFO L226 Difference]: Without dead ends: 724 [2019-10-15 01:28:01,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-15 01:28:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 718. [2019-10-15 01:28:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-15 01:28:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1017 transitions. [2019-10-15 01:28:01,363 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1017 transitions. Word has length 44 [2019-10-15 01:28:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,363 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1017 transitions. [2019-10-15 01:28:01,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1017 transitions. [2019-10-15 01:28:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:28:01,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,365 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:01,365 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash 394900860, now seen corresponding path program 1 times [2019-10-15 01:28:01,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:01,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151354904] [2019-10-15 01:28:01,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:01,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151354904] [2019-10-15 01:28:01,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:01,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:01,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19695151] [2019-10-15 01:28:01,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:01,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:01,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,412 INFO L87 Difference]: Start difference. First operand 718 states and 1017 transitions. Second operand 5 states. [2019-10-15 01:28:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,644 INFO L93 Difference]: Finished difference Result 1491 states and 2102 transitions. [2019-10-15 01:28:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:01,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-15 01:28:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,649 INFO L225 Difference]: With dead ends: 1491 [2019-10-15 01:28:01,649 INFO L226 Difference]: Without dead ends: 787 [2019-10-15 01:28:01,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-15 01:28:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2019-10-15 01:28:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-10-15 01:28:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1100 transitions. [2019-10-15 01:28:01,692 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1100 transitions. Word has length 45 [2019-10-15 01:28:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,693 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1100 transitions. [2019-10-15 01:28:01,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1100 transitions. [2019-10-15 01:28:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:01,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:01,695 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2061317727, now seen corresponding path program 1 times [2019-10-15 01:28:01,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:01,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114529621] [2019-10-15 01:28:01,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:01,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114529621] [2019-10-15 01:28:01,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:01,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:01,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944771318] [2019-10-15 01:28:01,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:01,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:01,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,734 INFO L87 Difference]: Start difference. First operand 785 states and 1100 transitions. Second operand 5 states. [2019-10-15 01:28:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,958 INFO L93 Difference]: Finished difference Result 1570 states and 2201 transitions. [2019-10-15 01:28:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:01,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-15 01:28:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,963 INFO L225 Difference]: With dead ends: 1570 [2019-10-15 01:28:01,963 INFO L226 Difference]: Without dead ends: 799 [2019-10-15 01:28:01,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-15 01:28:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 789. [2019-10-15 01:28:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-15 01:28:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1106 transitions. [2019-10-15 01:28:02,013 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1106 transitions. Word has length 47 [2019-10-15 01:28:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:02,013 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1106 transitions. [2019-10-15 01:28:02,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1106 transitions. [2019-10-15 01:28:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:02,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:02,014 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:02,015 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2062397286, now seen corresponding path program 1 times [2019-10-15 01:28:02,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036382741] [2019-10-15 01:28:02,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:02,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036382741] [2019-10-15 01:28:02,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:02,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:02,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567920619] [2019-10-15 01:28:02,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:02,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:02,061 INFO L87 Difference]: Start difference. First operand 789 states and 1106 transitions. Second operand 5 states. [2019-10-15 01:28:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:02,328 INFO L93 Difference]: Finished difference Result 1659 states and 2324 transitions. [2019-10-15 01:28:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:02,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-15 01:28:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:02,333 INFO L225 Difference]: With dead ends: 1659 [2019-10-15 01:28:02,334 INFO L226 Difference]: Without dead ends: 884 [2019-10-15 01:28:02,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-15 01:28:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 870. [2019-10-15 01:28:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-10-15 01:28:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1213 transitions. [2019-10-15 01:28:02,388 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1213 transitions. Word has length 47 [2019-10-15 01:28:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:02,388 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1213 transitions. [2019-10-15 01:28:02,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1213 transitions. [2019-10-15 01:28:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:28:02,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:02,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:02,391 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1357130696, now seen corresponding path program 1 times [2019-10-15 01:28:02,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536860246] [2019-10-15 01:28:02,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:02,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536860246] [2019-10-15 01:28:02,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:02,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:02,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124795862] [2019-10-15 01:28:02,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:02,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:02,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:02,440 INFO L87 Difference]: Start difference. First operand 870 states and 1213 transitions. Second operand 5 states. [2019-10-15 01:28:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:02,657 INFO L93 Difference]: Finished difference Result 1738 states and 2423 transitions. [2019-10-15 01:28:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:02,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 01:28:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:02,661 INFO L225 Difference]: With dead ends: 1738 [2019-10-15 01:28:02,662 INFO L226 Difference]: Without dead ends: 882 [2019-10-15 01:28:02,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-15 01:28:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2019-10-15 01:28:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-15 01:28:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1213 transitions. [2019-10-15 01:28:02,704 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1213 transitions. Word has length 48 [2019-10-15 01:28:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:02,704 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1213 transitions. [2019-10-15 01:28:02,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1213 transitions. [2019-10-15 01:28:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:28:02,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:02,706 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:02,706 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -393720600, now seen corresponding path program 1 times [2019-10-15 01:28:02,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836581806] [2019-10-15 01:28:02,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:02,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836581806] [2019-10-15 01:28:02,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:02,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:02,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503700115] [2019-10-15 01:28:02,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:02,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:02,747 INFO L87 Difference]: Start difference. First operand 872 states and 1213 transitions. Second operand 5 states. [2019-10-15 01:28:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:02,962 INFO L93 Difference]: Finished difference Result 1811 states and 2508 transitions. [2019-10-15 01:28:02,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:02,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 01:28:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:02,967 INFO L225 Difference]: With dead ends: 1811 [2019-10-15 01:28:02,967 INFO L226 Difference]: Without dead ends: 953 [2019-10-15 01:28:02,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-10-15 01:28:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 947. [2019-10-15 01:28:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-10-15 01:28:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1304 transitions. [2019-10-15 01:28:03,029 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1304 transitions. Word has length 48 [2019-10-15 01:28:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,029 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1304 transitions. [2019-10-15 01:28:03,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1304 transitions. [2019-10-15 01:28:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:28:03,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:03,031 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1882441225, now seen corresponding path program 1 times [2019-10-15 01:28:03,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628771011] [2019-10-15 01:28:03,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:03,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628771011] [2019-10-15 01:28:03,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150422615] [2019-10-15 01:28:03,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,078 INFO L87 Difference]: Start difference. First operand 947 states and 1304 transitions. Second operand 5 states. [2019-10-15 01:28:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:03,308 INFO L93 Difference]: Finished difference Result 1904 states and 2631 transitions. [2019-10-15 01:28:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:03,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 01:28:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:03,311 INFO L225 Difference]: With dead ends: 1904 [2019-10-15 01:28:03,311 INFO L226 Difference]: Without dead ends: 971 [2019-10-15 01:28:03,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-10-15 01:28:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 957. [2019-10-15 01:28:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-10-15 01:28:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1322 transitions. [2019-10-15 01:28:03,355 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1322 transitions. Word has length 48 [2019-10-15 01:28:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,355 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1322 transitions. [2019-10-15 01:28:03,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1322 transitions. [2019-10-15 01:28:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:28:03,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:03,357 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash -368829041, now seen corresponding path program 1 times [2019-10-15 01:28:03,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911122041] [2019-10-15 01:28:03,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:03,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911122041] [2019-10-15 01:28:03,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645880707] [2019-10-15 01:28:03,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,403 INFO L87 Difference]: Start difference. First operand 957 states and 1322 transitions. Second operand 5 states. [2019-10-15 01:28:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:03,635 INFO L93 Difference]: Finished difference Result 1906 states and 2631 transitions. [2019-10-15 01:28:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:03,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:28:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:03,641 INFO L225 Difference]: With dead ends: 1906 [2019-10-15 01:28:03,641 INFO L226 Difference]: Without dead ends: 963 [2019-10-15 01:28:03,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-10-15 01:28:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 957. [2019-10-15 01:28:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-10-15 01:28:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1318 transitions. [2019-10-15 01:28:03,688 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1318 transitions. Word has length 49 [2019-10-15 01:28:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,688 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1318 transitions. [2019-10-15 01:28:03,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1318 transitions. [2019-10-15 01:28:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:28:03,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:03,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:03,690 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267133, now seen corresponding path program 1 times [2019-10-15 01:28:03,690 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:03,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741445] [2019-10-15 01:28:03,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:03,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:03,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741445] [2019-10-15 01:28:03,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:03,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:03,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315565923] [2019-10-15 01:28:03,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:03,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:03,727 INFO L87 Difference]: Start difference. First operand 957 states and 1318 transitions. Second operand 5 states. [2019-10-15 01:28:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:03,973 INFO L93 Difference]: Finished difference Result 1983 states and 2718 transitions. [2019-10-15 01:28:03,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:03,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 01:28:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:03,979 INFO L225 Difference]: With dead ends: 1983 [2019-10-15 01:28:03,979 INFO L226 Difference]: Without dead ends: 1040 [2019-10-15 01:28:03,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-10-15 01:28:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-10-15 01:28:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-15 01:28:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1409 transitions. [2019-10-15 01:28:04,056 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1409 transitions. Word has length 50 [2019-10-15 01:28:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,056 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1409 transitions. [2019-10-15 01:28:04,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1409 transitions. [2019-10-15 01:28:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:28:04,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,058 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,058 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 36294858, now seen corresponding path program 1 times [2019-10-15 01:28:04,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845582255] [2019-10-15 01:28:04,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:04,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845582255] [2019-10-15 01:28:04,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666445261] [2019-10-15 01:28:04,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,097 INFO L87 Difference]: Start difference. First operand 1034 states and 1409 transitions. Second operand 5 states. [2019-10-15 01:28:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,339 INFO L93 Difference]: Finished difference Result 2060 states and 2805 transitions. [2019-10-15 01:28:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-15 01:28:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,344 INFO L225 Difference]: With dead ends: 2060 [2019-10-15 01:28:04,345 INFO L226 Difference]: Without dead ends: 1040 [2019-10-15 01:28:04,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-10-15 01:28:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-10-15 01:28:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-15 01:28:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1405 transitions. [2019-10-15 01:28:04,394 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1405 transitions. Word has length 51 [2019-10-15 01:28:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,395 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1405 transitions. [2019-10-15 01:28:04,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1405 transitions. [2019-10-15 01:28:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:28:04,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,396 INFO L380 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-15 01:28:04,396 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1896340220, now seen corresponding path program 1 times [2019-10-15 01:28:04,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575086772] [2019-10-15 01:28:04,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,418 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-15 01:28:04,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575086772] [2019-10-15 01:28:04,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:04,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195378656] [2019-10-15 01:28:04,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:04,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:04,421 INFO L87 Difference]: Start difference. First operand 1034 states and 1405 transitions. Second operand 3 states. [2019-10-15 01:28:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,466 INFO L93 Difference]: Finished difference Result 2054 states and 2792 transitions. [2019-10-15 01:28:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:04,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:28:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,471 INFO L225 Difference]: With dead ends: 2054 [2019-10-15 01:28:04,472 INFO L226 Difference]: Without dead ends: 1034 [2019-10-15 01:28:04,473 INFO L600 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-15 01:28:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-10-15 01:28:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-10-15 01:28:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-15 01:28:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1378 transitions. [2019-10-15 01:28:04,522 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1378 transitions. Word has length 54 [2019-10-15 01:28:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,522 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1378 transitions. [2019-10-15 01:28:04,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1378 transitions. [2019-10-15 01:28:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:28:04,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,524 INFO L380 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-15 01:28:04,524 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1048271307, now seen corresponding path program 1 times [2019-10-15 01:28:04,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641713177] [2019-10-15 01:28:04,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:04,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641713177] [2019-10-15 01:28:04,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:04,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394144268] [2019-10-15 01:28:04,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:04,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:04,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:04,555 INFO L87 Difference]: Start difference. First operand 1034 states and 1378 transitions. Second operand 3 states. [2019-10-15 01:28:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,626 INFO L93 Difference]: Finished difference Result 2072 states and 2760 transitions. [2019-10-15 01:28:04,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:04,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 01:28:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,633 INFO L225 Difference]: With dead ends: 2072 [2019-10-15 01:28:04,633 INFO L226 Difference]: Without dead ends: 1052 [2019-10-15 01:28:04,635 INFO L600 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-15 01:28:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-15 01:28:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-10-15 01:28:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-15 01:28:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1369 transitions. [2019-10-15 01:28:04,688 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1369 transitions. Word has length 55 [2019-10-15 01:28:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,689 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1369 transitions. [2019-10-15 01:28:04,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1369 transitions. [2019-10-15 01:28:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:28:04,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,690 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1564495280, now seen corresponding path program 1 times [2019-10-15 01:28:04,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792556022] [2019-10-15 01:28:04,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:04,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792556022] [2019-10-15 01:28:04,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448851257] [2019-10-15 01:28:04,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,729 INFO L87 Difference]: Start difference. First operand 1046 states and 1369 transitions. Second operand 5 states. [2019-10-15 01:28:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,004 INFO L93 Difference]: Finished difference Result 2175 states and 2835 transitions. [2019-10-15 01:28:05,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-15 01:28:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,009 INFO L225 Difference]: With dead ends: 2175 [2019-10-15 01:28:05,009 INFO L226 Difference]: Without dead ends: 1143 [2019-10-15 01:28:05,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-10-15 01:28:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1131. [2019-10-15 01:28:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-10-15 01:28:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1451 transitions. [2019-10-15 01:28:05,067 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1451 transitions. Word has length 57 [2019-10-15 01:28:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,067 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1451 transitions. [2019-10-15 01:28:05,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1451 transitions. [2019-10-15 01:28:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:28:05,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,069 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,069 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash -928520343, now seen corresponding path program 1 times [2019-10-15 01:28:05,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773623163] [2019-10-15 01:28:05,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:05,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773623163] [2019-10-15 01:28:05,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445865235] [2019-10-15 01:28:05,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,108 INFO L87 Difference]: Start difference. First operand 1131 states and 1451 transitions. Second operand 5 states. [2019-10-15 01:28:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,329 INFO L93 Difference]: Finished difference Result 2266 states and 2910 transitions. [2019-10-15 01:28:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-15 01:28:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,334 INFO L225 Difference]: With dead ends: 2266 [2019-10-15 01:28:05,334 INFO L226 Difference]: Without dead ends: 1149 [2019-10-15 01:28:05,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-10-15 01:28:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1135. [2019-10-15 01:28:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-10-15 01:28:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1456 transitions. [2019-10-15 01:28:05,391 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1456 transitions. Word has length 58 [2019-10-15 01:28:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,391 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 1456 transitions. [2019-10-15 01:28:05,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1456 transitions. [2019-10-15 01:28:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:28:05,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,393 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 332165990, now seen corresponding path program 1 times [2019-10-15 01:28:05,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51593037] [2019-10-15 01:28:05,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:05,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51593037] [2019-10-15 01:28:05,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967058280] [2019-10-15 01:28:05,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,440 INFO L87 Difference]: Start difference. First operand 1135 states and 1456 transitions. Second operand 5 states. [2019-10-15 01:28:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,737 INFO L93 Difference]: Finished difference Result 2357 states and 3013 transitions. [2019-10-15 01:28:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 01:28:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,745 INFO L225 Difference]: With dead ends: 2357 [2019-10-15 01:28:05,745 INFO L226 Difference]: Without dead ends: 1236 [2019-10-15 01:28:05,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-15 01:28:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1224. [2019-10-15 01:28:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-10-15 01:28:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1556 transitions. [2019-10-15 01:28:05,858 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1556 transitions. Word has length 59 [2019-10-15 01:28:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,859 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1556 transitions. [2019-10-15 01:28:05,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1556 transitions. [2019-10-15 01:28:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:28:05,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,861 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,861 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1890648705, now seen corresponding path program 1 times [2019-10-15 01:28:05,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191125928] [2019-10-15 01:28:05,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,908 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-15 01:28:05,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191125928] [2019-10-15 01:28:05,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:05,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475379689] [2019-10-15 01:28:05,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:05,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:05,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:05,911 INFO L87 Difference]: Start difference. First operand 1224 states and 1556 transitions. Second operand 3 states. [2019-10-15 01:28:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,103 INFO L93 Difference]: Finished difference Result 3630 states and 4604 transitions. [2019-10-15 01:28:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:06,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:28:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,115 INFO L225 Difference]: With dead ends: 3630 [2019-10-15 01:28:06,115 INFO L226 Difference]: Without dead ends: 2420 [2019-10-15 01:28:06,118 INFO L600 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-15 01:28:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-10-15 01:28:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1840. [2019-10-15 01:28:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-10-15 01:28:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2331 transitions. [2019-10-15 01:28:06,249 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2331 transitions. Word has length 60 [2019-10-15 01:28:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,249 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 2331 transitions. [2019-10-15 01:28:06,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2331 transitions. [2019-10-15 01:28:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:28:06,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,252 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1918883551, now seen corresponding path program 1 times [2019-10-15 01:28:06,253 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557783805] [2019-10-15 01:28:06,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:06,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557783805] [2019-10-15 01:28:06,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211306105] [2019-10-15 01:28:06,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,309 INFO L87 Difference]: Start difference. First operand 1840 states and 2331 transitions. Second operand 5 states. [2019-10-15 01:28:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,735 INFO L93 Difference]: Finished difference Result 3688 states and 4677 transitions. [2019-10-15 01:28:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 01:28:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,743 INFO L225 Difference]: With dead ends: 3688 [2019-10-15 01:28:06,743 INFO L226 Difference]: Without dead ends: 1788 [2019-10-15 01:28:06,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-15 01:28:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1771. [2019-10-15 01:28:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-15 01:28:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2226 transitions. [2019-10-15 01:28:06,865 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2226 transitions. Word has length 60 [2019-10-15 01:28:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,866 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2226 transitions. [2019-10-15 01:28:06,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2226 transitions. [2019-10-15 01:28:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:28:06,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,867 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,867 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1409568447, now seen corresponding path program 1 times [2019-10-15 01:28:06,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832807336] [2019-10-15 01:28:06,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,889 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-15 01:28:06,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832807336] [2019-10-15 01:28:06,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:06,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580664567] [2019-10-15 01:28:06,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:06,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:06,891 INFO L87 Difference]: Start difference. First operand 1771 states and 2226 transitions. Second operand 3 states. [2019-10-15 01:28:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,103 INFO L93 Difference]: Finished difference Result 3545 states and 4460 transitions. [2019-10-15 01:28:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:07,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:28:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,112 INFO L225 Difference]: With dead ends: 3545 [2019-10-15 01:28:07,113 INFO L226 Difference]: Without dead ends: 1789 [2019-10-15 01:28:07,115 INFO L600 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-15 01:28:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-10-15 01:28:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1771. [2019-10-15 01:28:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-15 01:28:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2221 transitions. [2019-10-15 01:28:07,197 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2221 transitions. Word has length 60 [2019-10-15 01:28:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,197 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2221 transitions. [2019-10-15 01:28:07,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2221 transitions. [2019-10-15 01:28:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:28:07,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,198 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,199 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2089626817, now seen corresponding path program 1 times [2019-10-15 01:28:07,199 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564732632] [2019-10-15 01:28:07,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,228 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-15 01:28:07,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564732632] [2019-10-15 01:28:07,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:07,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656094104] [2019-10-15 01:28:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:07,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:07,230 INFO L87 Difference]: Start difference. First operand 1771 states and 2221 transitions. Second operand 3 states. [2019-10-15 01:28:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,341 INFO L93 Difference]: Finished difference Result 3492 states and 4355 transitions. [2019-10-15 01:28:07,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:07,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:28:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,346 INFO L225 Difference]: With dead ends: 3492 [2019-10-15 01:28:07,346 INFO L226 Difference]: Without dead ends: 2328 [2019-10-15 01:28:07,349 INFO L600 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-15 01:28:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-10-15 01:28:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1763. [2019-10-15 01:28:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-10-15 01:28:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2196 transitions. [2019-10-15 01:28:07,437 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2196 transitions. Word has length 60 [2019-10-15 01:28:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,437 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2196 transitions. [2019-10-15 01:28:07,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2196 transitions. [2019-10-15 01:28:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:28:07,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,439 INFO L380 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-15 01:28:07,439 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1796569389, now seen corresponding path program 1 times [2019-10-15 01:28:07,439 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407422883] [2019-10-15 01:28:07,440 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,440 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,482 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-15 01:28:07,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407422883] [2019-10-15 01:28:07,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:07,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039319950] [2019-10-15 01:28:07,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:07,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:07,484 INFO L87 Difference]: Start difference. First operand 1763 states and 2196 transitions. Second operand 3 states. [2019-10-15 01:28:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,669 INFO L93 Difference]: Finished difference Result 5220 states and 6468 transitions. [2019-10-15 01:28:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:07,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 01:28:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,677 INFO L225 Difference]: With dead ends: 5220 [2019-10-15 01:28:07,677 INFO L226 Difference]: Without dead ends: 3472 [2019-10-15 01:28:07,681 INFO L600 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-15 01:28:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-10-15 01:28:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2019-10-15 01:28:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3470 states. [2019-10-15 01:28:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4239 transitions. [2019-10-15 01:28:07,928 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4239 transitions. Word has length 61 [2019-10-15 01:28:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,928 INFO L462 AbstractCegarLoop]: Abstraction has 3470 states and 4239 transitions. [2019-10-15 01:28:07,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4239 transitions. [2019-10-15 01:28:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:28:07,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,930 INFO L380 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-15 01:28:07,931 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425408, now seen corresponding path program 1 times [2019-10-15 01:28:07,931 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789262264] [2019-10-15 01:28:07,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:28:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:28:07,999 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-15 01:28:08,000 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-15 01:28:08,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:28:08 BoogieIcfgContainer [2019-10-15 01:28:08,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:28:08,112 INFO L168 Benchmark]: Toolchain (without parser) took 15957.77 ms. Allocated memory was 137.4 MB in the beginning and 497.0 MB in the end (delta: 359.7 MB). Free memory was 101.9 MB in the beginning and 383.8 MB in the end (delta: -281.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,113 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 176.0 MB in the end (delta: -74.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,113 INFO L168 Benchmark]: Boogie Preprocessor took 57.29 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,114 INFO L168 Benchmark]: RCFGBuilder took 871.91 ms. Allocated memory is still 201.3 MB. Free memory was 173.2 MB in the beginning and 121.6 MB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,114 INFO L168 Benchmark]: TraceAbstraction took 14466.63 ms. Allocated memory was 201.3 MB in the beginning and 497.0 MB in the end (delta: 295.7 MB). Free memory was 120.9 MB in the beginning and 383.8 MB in the end (delta: -262.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:08,117 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 556.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 176.0 MB in the end (delta: -74.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.29 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.91 ms. Allocated memory is still 201.3 MB. Free memory was 173.2 MB in the beginning and 121.6 MB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14466.63 ms. Allocated memory was 201.3 MB in the beginning and 497.0 MB in the end (delta: 295.7 MB). Free memory was 120.9 MB in the beginning and 383.8 MB in the end (delta: -262.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L646] int s ; [L647] int tmp ; [L651] s = 8464 VAL [s=8464] [L652] CALL ssl3_accept(s) VAL [\old(initial_state)=8464] [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__s3__tmp__reuse_message = 0 [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 VAL [\old(initial_state)=8464, blastFlag=0, cb=0, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L89] s__in_handshake ++ VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L90] COND TRUE tmp___1 + 12288 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L91] COND TRUE tmp___2 + 16384 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L95] COND FALSE !(s__cert == 0) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L99] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L101] state = s__state VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L102] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L105] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L108] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L111] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L114] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L117] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L120] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L123] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L126] COND TRUE s__state == 8464 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L603] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L604] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L605] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L606] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L607] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L608] COND FALSE !(state == 8496) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L615] COND FALSE !(\read(s__debug)) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L621] COND TRUE cb != 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L622] COND TRUE s__state != state [L623] new_state = s__state [L624] s__state = state [L625] s__state = new_state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L630] skip = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L99] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L101] state = s__state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L102] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L105] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L108] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L111] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L114] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L117] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L120] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L123] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L126] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L129] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L132] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L135] COND TRUE s__state == 8496 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L290] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L298] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L603] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L604] COND TRUE ! skip VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L605] COND TRUE tmp___1 != -12288 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L606] COND TRUE s__state != 8656 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L607] COND TRUE tmp___2 != -16384 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L608] COND TRUE state == 8496 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L641] __VERIFIER_error() VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, new_state=8496, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algo_strength=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.3s, OverallIterations: 42, TraceHistogramMax: 2, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7582 SDtfs, 15139 SDslu, 7637 SDs, 0 SdLazy, 5353 SolverSat, 1506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3470occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 1597 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1864 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1761 ConstructedInterpolants, 0 QuantifiedInterpolants, 234972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...