/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:45,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:45,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:45,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:45,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:45,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:45,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:45,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:45,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:45,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:45,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:45,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:45,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:45,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:45,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:45,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:45,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:45,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:45,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:45,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:45,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:45,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:45,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:45,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:45,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:45,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:45,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:45,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:45,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:45,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:45,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:45,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:45,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:45,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:45,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:45,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:45,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:45,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:45,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:45,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:45,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:45,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:22:45,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:45,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:45,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:45,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:45,902 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:45,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:45,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:45,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:45,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:45,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:45,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:45,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:45,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:45,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:45,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:45,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:45,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:45,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:45,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:45,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:45,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:45,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:45,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:45,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:45,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:45,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:45,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:45,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:45,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:46,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:46,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:46,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:46,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:46,201 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:46,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-06 22:22:46,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c53a1edc0/c2cb43320aa9446f91fb0190d04d1f86/FLAGe73442d6c [2019-11-06 22:22:46,715 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:46,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-06 22:22:46,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c53a1edc0/c2cb43320aa9446f91fb0190d04d1f86/FLAGe73442d6c [2019-11-06 22:22:47,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c53a1edc0/c2cb43320aa9446f91fb0190d04d1f86 [2019-11-06 22:22:47,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:47,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:47,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:47,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:47,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:47,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3a9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47, skipping insertion in model container [2019-11-06 22:22:47,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,069 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:47,122 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:47,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:47,489 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:47,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:47,665 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:47,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47 WrapperNode [2019-11-06 22:22:47,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:47,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:47,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:47,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:47,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... [2019-11-06 22:22:47,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:47,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:47,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:47,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:47,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-06 22:22:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:47,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:47,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:48,036 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:48,646 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-06 22:22:48,646 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-06 22:22:48,649 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:48,649 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:48,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:48 BoogieIcfgContainer [2019-11-06 22:22:48,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:48,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:48,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:48,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:48,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:47" (1/3) ... [2019-11-06 22:22:48,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c80fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:48, skipping insertion in model container [2019-11-06 22:22:48,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:47" (2/3) ... [2019-11-06 22:22:48,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c80fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:48, skipping insertion in model container [2019-11-06 22:22:48,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:48" (3/3) ... [2019-11-06 22:22:48,659 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-06 22:22:48,670 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:48,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:48,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:48,716 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:48,716 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:48,716 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:48,717 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:48,717 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:48,717 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:48,717 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:48,717 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-06 22:22:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 22:22:48,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:48,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:48,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2138433857, now seen corresponding path program 1 times [2019-11-06 22:22:48,764 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:48,764 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376627181] [2019-11-06 22:22:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:49,036 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376627181] [2019-11-06 22:22:49,038 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:49,038 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:49,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377329953] [2019-11-06 22:22:49,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:49,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:49,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:49,056 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 5 states. [2019-11-06 22:22:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:49,440 INFO L93 Difference]: Finished difference Result 333 states and 566 transitions. [2019-11-06 22:22:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:49,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-06 22:22:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:49,461 INFO L225 Difference]: With dead ends: 333 [2019-11-06 22:22:49,461 INFO L226 Difference]: Without dead ends: 166 [2019-11-06 22:22:49,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-06 22:22:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-11-06 22:22:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-06 22:22:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2019-11-06 22:22:49,520 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 28 [2019-11-06 22:22:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:49,520 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2019-11-06 22:22:49,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2019-11-06 22:22:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:49,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:49,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:49,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1059341068, now seen corresponding path program 1 times [2019-11-06 22:22:49,524 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:49,524 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029323947] [2019-11-06 22:22:49,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:49,622 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029323947] [2019-11-06 22:22:49,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:49,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:49,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190949687] [2019-11-06 22:22:49,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:49,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:49,626 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand 5 states. [2019-11-06 22:22:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:49,881 INFO L93 Difference]: Finished difference Result 336 states and 528 transitions. [2019-11-06 22:22:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:49,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-06 22:22:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:49,885 INFO L225 Difference]: With dead ends: 336 [2019-11-06 22:22:49,885 INFO L226 Difference]: Without dead ends: 187 [2019-11-06 22:22:49,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-06 22:22:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-06 22:22:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-06 22:22:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2019-11-06 22:22:49,906 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 29 [2019-11-06 22:22:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:49,907 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2019-11-06 22:22:49,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2019-11-06 22:22:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:49,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:49,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:49,909 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash -947080425, now seen corresponding path program 1 times [2019-11-06 22:22:49,910 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:49,910 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575095643] [2019-11-06 22:22:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:50,021 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575095643] [2019-11-06 22:22:50,021 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:50,022 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:50,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056684985] [2019-11-06 22:22:50,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:50,024 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:50,025 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand 5 states. [2019-11-06 22:22:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:50,284 INFO L93 Difference]: Finished difference Result 367 states and 572 transitions. [2019-11-06 22:22:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:50,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-06 22:22:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:50,289 INFO L225 Difference]: With dead ends: 367 [2019-11-06 22:22:50,290 INFO L226 Difference]: Without dead ends: 195 [2019-11-06 22:22:50,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-06 22:22:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-11-06 22:22:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-06 22:22:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2019-11-06 22:22:50,335 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 29 [2019-11-06 22:22:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:50,336 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2019-11-06 22:22:50,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2019-11-06 22:22:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:50,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:50,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:50,341 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash 837081432, now seen corresponding path program 1 times [2019-11-06 22:22:50,341 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:50,342 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349441726] [2019-11-06 22:22:50,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:50,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349441726] [2019-11-06 22:22:50,460 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:50,460 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:50,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343710096] [2019-11-06 22:22:50,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:50,461 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:50,462 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand 5 states. [2019-11-06 22:22:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:50,718 INFO L93 Difference]: Finished difference Result 372 states and 582 transitions. [2019-11-06 22:22:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:50,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-06 22:22:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:50,720 INFO L225 Difference]: With dead ends: 372 [2019-11-06 22:22:50,721 INFO L226 Difference]: Without dead ends: 194 [2019-11-06 22:22:50,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-06 22:22:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-11-06 22:22:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-06 22:22:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 299 transitions. [2019-11-06 22:22:50,735 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 299 transitions. Word has length 29 [2019-11-06 22:22:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:50,735 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 299 transitions. [2019-11-06 22:22:50,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 299 transitions. [2019-11-06 22:22:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 22:22:50,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:50,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:50,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2002433700, now seen corresponding path program 1 times [2019-11-06 22:22:50,738 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:50,738 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441825051] [2019-11-06 22:22:50,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:50,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441825051] [2019-11-06 22:22:50,805 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:50,805 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:50,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946362587] [2019-11-06 22:22:50,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:50,806 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:50,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:50,809 INFO L87 Difference]: Start difference. First operand 192 states and 299 transitions. Second operand 5 states. [2019-11-06 22:22:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:50,998 INFO L93 Difference]: Finished difference Result 383 states and 594 transitions. [2019-11-06 22:22:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:50,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-06 22:22:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,000 INFO L225 Difference]: With dead ends: 383 [2019-11-06 22:22:51,000 INFO L226 Difference]: Without dead ends: 204 [2019-11-06 22:22:51,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-06 22:22:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-06 22:22:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-06 22:22:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 297 transitions. [2019-11-06 22:22:51,013 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 297 transitions. Word has length 30 [2019-11-06 22:22:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,014 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 297 transitions. [2019-11-06 22:22:51,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 297 transitions. [2019-11-06 22:22:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 22:22:51,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:51,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 533516532, now seen corresponding path program 1 times [2019-11-06 22:22:51,017 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,017 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569345923] [2019-11-06 22:22:51,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:51,099 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569345923] [2019-11-06 22:22:51,100 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:51,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:51,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381250989] [2019-11-06 22:22:51,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:51,102 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:51,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:51,103 INFO L87 Difference]: Start difference. First operand 192 states and 297 transitions. Second operand 5 states. [2019-11-06 22:22:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:51,297 INFO L93 Difference]: Finished difference Result 383 states and 590 transitions. [2019-11-06 22:22:51,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:51,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-06 22:22:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,299 INFO L225 Difference]: With dead ends: 383 [2019-11-06 22:22:51,300 INFO L226 Difference]: Without dead ends: 204 [2019-11-06 22:22:51,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-06 22:22:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-06 22:22:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-06 22:22:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2019-11-06 22:22:51,312 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 31 [2019-11-06 22:22:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,313 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2019-11-06 22:22:51,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2019-11-06 22:22:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 22:22:51,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:51,315 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -714108489, now seen corresponding path program 1 times [2019-11-06 22:22:51,315 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,315 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999691552] [2019-11-06 22:22:51,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:51,368 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999691552] [2019-11-06 22:22:51,368 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:51,368 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:51,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466184454] [2019-11-06 22:22:51,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:51,369 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:51,370 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand 5 states. [2019-11-06 22:22:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:51,568 INFO L93 Difference]: Finished difference Result 383 states and 586 transitions. [2019-11-06 22:22:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:51,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-06 22:22:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,570 INFO L225 Difference]: With dead ends: 383 [2019-11-06 22:22:51,570 INFO L226 Difference]: Without dead ends: 204 [2019-11-06 22:22:51,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-06 22:22:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2019-11-06 22:22:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-06 22:22:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2019-11-06 22:22:51,583 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 32 [2019-11-06 22:22:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,584 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-06 22:22:51,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2019-11-06 22:22:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 22:22:51,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:51,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash 522773526, now seen corresponding path program 1 times [2019-11-06 22:22:51,592 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,592 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310656483] [2019-11-06 22:22:51,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:51,638 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310656483] [2019-11-06 22:22:51,638 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:51,638 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:51,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465256450] [2019-11-06 22:22:51,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:51,639 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:51,640 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand 3 states. [2019-11-06 22:22:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:51,667 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2019-11-06 22:22:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:51,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 22:22:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,671 INFO L225 Difference]: With dead ends: 542 [2019-11-06 22:22:51,671 INFO L226 Difference]: Without dead ends: 363 [2019-11-06 22:22:51,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-06 22:22:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-11-06 22:22:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-06 22:22:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-11-06 22:22:51,692 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 32 [2019-11-06 22:22:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,692 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-11-06 22:22:51,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-11-06 22:22:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 22:22:51,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:51,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1890290600, now seen corresponding path program 1 times [2019-11-06 22:22:51,695 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,695 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140826229] [2019-11-06 22:22:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:51,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140826229] [2019-11-06 22:22:51,754 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:51,754 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:22:51,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804740942] [2019-11-06 22:22:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:51,755 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:51,756 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-11-06 22:22:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:51,943 INFO L93 Difference]: Finished difference Result 437 states and 658 transitions. [2019-11-06 22:22:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:51,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-06 22:22:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:51,946 INFO L225 Difference]: With dead ends: 437 [2019-11-06 22:22:51,947 INFO L226 Difference]: Without dead ends: 435 [2019-11-06 22:22:51,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-06 22:22:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 370. [2019-11-06 22:22:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-06 22:22:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2019-11-06 22:22:51,968 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 33 [2019-11-06 22:22:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:51,968 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2019-11-06 22:22:51,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2019-11-06 22:22:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 22:22:51,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:51,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:51,970 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash -784025939, now seen corresponding path program 1 times [2019-11-06 22:22:51,970 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:51,970 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478876850] [2019-11-06 22:22:51,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:52,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478876850] [2019-11-06 22:22:52,022 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:52,023 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:52,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285612249] [2019-11-06 22:22:52,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:52,023 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:52,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,027 INFO L87 Difference]: Start difference. First operand 370 states and 563 transitions. Second operand 5 states. [2019-11-06 22:22:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:52,228 INFO L93 Difference]: Finished difference Result 748 states and 1133 transitions. [2019-11-06 22:22:52,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:52,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-06 22:22:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:52,231 INFO L225 Difference]: With dead ends: 748 [2019-11-06 22:22:52,231 INFO L226 Difference]: Without dead ends: 392 [2019-11-06 22:22:52,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-06 22:22:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 370. [2019-11-06 22:22:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-06 22:22:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2019-11-06 22:22:52,252 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 34 [2019-11-06 22:22:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:52,252 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2019-11-06 22:22:52,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2019-11-06 22:22:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 22:22:52,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:52,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:52,254 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash -48568943, now seen corresponding path program 1 times [2019-11-06 22:22:52,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:52,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933359504] [2019-11-06 22:22:52,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:52,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933359504] [2019-11-06 22:22:52,297 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:52,297 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:52,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998374641] [2019-11-06 22:22:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:52,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,299 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand 5 states. [2019-11-06 22:22:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:52,484 INFO L93 Difference]: Finished difference Result 738 states and 1117 transitions. [2019-11-06 22:22:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:52,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-06 22:22:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:52,487 INFO L225 Difference]: With dead ends: 738 [2019-11-06 22:22:52,487 INFO L226 Difference]: Without dead ends: 382 [2019-11-06 22:22:52,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-06 22:22:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-06 22:22:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-06 22:22:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 565 transitions. [2019-11-06 22:22:52,508 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 565 transitions. Word has length 34 [2019-11-06 22:22:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:52,508 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 565 transitions. [2019-11-06 22:22:52,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 565 transitions. [2019-11-06 22:22:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 22:22:52,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:52,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:52,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 815405373, now seen corresponding path program 1 times [2019-11-06 22:22:52,511 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:52,511 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535286687] [2019-11-06 22:22:52,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:52,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535286687] [2019-11-06 22:22:52,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:52,563 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:52,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329892314] [2019-11-06 22:22:52,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:52,564 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,565 INFO L87 Difference]: Start difference. First operand 374 states and 565 transitions. Second operand 5 states. [2019-11-06 22:22:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:52,760 INFO L93 Difference]: Finished difference Result 787 states and 1184 transitions. [2019-11-06 22:22:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:52,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-06 22:22:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:52,764 INFO L225 Difference]: With dead ends: 787 [2019-11-06 22:22:52,764 INFO L226 Difference]: Without dead ends: 427 [2019-11-06 22:22:52,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-06 22:22:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2019-11-06 22:22:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-06 22:22:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 626 transitions. [2019-11-06 22:22:52,790 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 626 transitions. Word has length 35 [2019-11-06 22:22:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:52,791 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 626 transitions. [2019-11-06 22:22:52,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 626 transitions. [2019-11-06 22:22:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 22:22:52,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:52,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:52,793 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:52,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1933074875, now seen corresponding path program 1 times [2019-11-06 22:22:52,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:52,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359419727] [2019-11-06 22:22:52,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:52,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359419727] [2019-11-06 22:22:52,851 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:52,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:52,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678387140] [2019-11-06 22:22:52,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:52,852 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:52,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:52,853 INFO L87 Difference]: Start difference. First operand 419 states and 626 transitions. Second operand 5 states. [2019-11-06 22:22:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:53,086 INFO L93 Difference]: Finished difference Result 883 states and 1316 transitions. [2019-11-06 22:22:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:53,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-06 22:22:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:53,089 INFO L225 Difference]: With dead ends: 883 [2019-11-06 22:22:53,090 INFO L226 Difference]: Without dead ends: 478 [2019-11-06 22:22:53,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-06 22:22:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2019-11-06 22:22:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-06 22:22:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2019-11-06 22:22:53,139 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 38 [2019-11-06 22:22:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:53,140 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2019-11-06 22:22:53,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2019-11-06 22:22:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 22:22:53,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:53,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:53,141 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:53,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1841800743, now seen corresponding path program 1 times [2019-11-06 22:22:53,142 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:53,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639821433] [2019-11-06 22:22:53,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:53,184 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639821433] [2019-11-06 22:22:53,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:53,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:53,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11222965] [2019-11-06 22:22:53,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:53,185 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:53,186 INFO L87 Difference]: Start difference. First operand 468 states and 693 transitions. Second operand 5 states. [2019-11-06 22:22:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:53,425 INFO L93 Difference]: Finished difference Result 987 states and 1456 transitions. [2019-11-06 22:22:53,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:53,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-06 22:22:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:53,430 INFO L225 Difference]: With dead ends: 987 [2019-11-06 22:22:53,430 INFO L226 Difference]: Without dead ends: 533 [2019-11-06 22:22:53,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-06 22:22:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 523. [2019-11-06 22:22:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-06 22:22:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 768 transitions. [2019-11-06 22:22:53,465 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 768 transitions. Word has length 38 [2019-11-06 22:22:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:53,465 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 768 transitions. [2019-11-06 22:22:53,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 768 transitions. [2019-11-06 22:22:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:22:53,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:53,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:53,467 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -416177979, now seen corresponding path program 1 times [2019-11-06 22:22:53,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:53,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670125157] [2019-11-06 22:22:53,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:53,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670125157] [2019-11-06 22:22:53,523 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:53,524 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:53,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238194674] [2019-11-06 22:22:53,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:53,525 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:53,526 INFO L87 Difference]: Start difference. First operand 523 states and 768 transitions. Second operand 5 states. [2019-11-06 22:22:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:53,771 INFO L93 Difference]: Finished difference Result 1048 states and 1541 transitions. [2019-11-06 22:22:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:53,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-06 22:22:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:53,775 INFO L225 Difference]: With dead ends: 1048 [2019-11-06 22:22:53,775 INFO L226 Difference]: Without dead ends: 539 [2019-11-06 22:22:53,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-06 22:22:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-11-06 22:22:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-06 22:22:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2019-11-06 22:22:53,808 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 39 [2019-11-06 22:22:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:53,809 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2019-11-06 22:22:53,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2019-11-06 22:22:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:22:53,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:53,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:53,811 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -758043503, now seen corresponding path program 1 times [2019-11-06 22:22:53,811 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:53,811 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283435879] [2019-11-06 22:22:53,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:53,890 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283435879] [2019-11-06 22:22:53,890 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:53,892 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:53,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078318846] [2019-11-06 22:22:53,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:53,893 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:53,894 INFO L87 Difference]: Start difference. First operand 529 states and 778 transitions. Second operand 5 states. [2019-11-06 22:22:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:54,123 INFO L93 Difference]: Finished difference Result 1054 states and 1551 transitions. [2019-11-06 22:22:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:54,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-06 22:22:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:54,129 INFO L225 Difference]: With dead ends: 1054 [2019-11-06 22:22:54,129 INFO L226 Difference]: Without dead ends: 539 [2019-11-06 22:22:54,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-06 22:22:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 529. [2019-11-06 22:22:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-06 22:22:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 774 transitions. [2019-11-06 22:22:54,172 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 774 transitions. Word has length 39 [2019-11-06 22:22:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 774 transitions. [2019-11-06 22:22:54,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 774 transitions. [2019-11-06 22:22:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 22:22:54,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:54,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:54,175 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -342748957, now seen corresponding path program 1 times [2019-11-06 22:22:54,176 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:54,178 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138498870] [2019-11-06 22:22:54,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:54,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138498870] [2019-11-06 22:22:54,232 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:54,232 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:54,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174669382] [2019-11-06 22:22:54,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:54,233 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:54,234 INFO L87 Difference]: Start difference. First operand 529 states and 774 transitions. Second operand 5 states. [2019-11-06 22:22:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:54,538 INFO L93 Difference]: Finished difference Result 1121 states and 1638 transitions. [2019-11-06 22:22:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:54,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-06 22:22:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:54,544 INFO L225 Difference]: With dead ends: 1121 [2019-11-06 22:22:54,544 INFO L226 Difference]: Without dead ends: 606 [2019-11-06 22:22:54,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-06 22:22:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2019-11-06 22:22:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-11-06 22:22:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 853 transitions. [2019-11-06 22:22:54,588 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 853 transitions. Word has length 40 [2019-11-06 22:22:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:54,589 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 853 transitions. [2019-11-06 22:22:54,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 853 transitions. [2019-11-06 22:22:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 22:22:54,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:54,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:54,591 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1593154033, now seen corresponding path program 1 times [2019-11-06 22:22:54,592 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:54,592 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406837255] [2019-11-06 22:22:54,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:54,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406837255] [2019-11-06 22:22:54,643 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:54,643 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:54,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741932793] [2019-11-06 22:22:54,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:54,644 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:54,645 INFO L87 Difference]: Start difference. First operand 588 states and 853 transitions. Second operand 5 states. [2019-11-06 22:22:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:54,871 INFO L93 Difference]: Finished difference Result 1188 states and 1731 transitions. [2019-11-06 22:22:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:54,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-06 22:22:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:54,875 INFO L225 Difference]: With dead ends: 1188 [2019-11-06 22:22:54,875 INFO L226 Difference]: Without dead ends: 614 [2019-11-06 22:22:54,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-06 22:22:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2019-11-06 22:22:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-06 22:22:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 867 transitions. [2019-11-06 22:22:54,909 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 867 transitions. Word has length 41 [2019-11-06 22:22:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:54,909 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 867 transitions. [2019-11-06 22:22:54,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 867 transitions. [2019-11-06 22:22:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:22:54,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:54,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:54,911 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -104670206, now seen corresponding path program 1 times [2019-11-06 22:22:54,912 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:54,912 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191769295] [2019-11-06 22:22:54,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:54,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191769295] [2019-11-06 22:22:54,953 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:54,953 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:54,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221790033] [2019-11-06 22:22:54,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:54,954 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:54,955 INFO L87 Difference]: Start difference. First operand 596 states and 867 transitions. Second operand 5 states. [2019-11-06 22:22:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:55,181 INFO L93 Difference]: Finished difference Result 1261 states and 1832 transitions. [2019-11-06 22:22:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:55,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-06 22:22:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:55,185 INFO L225 Difference]: With dead ends: 1261 [2019-11-06 22:22:55,186 INFO L226 Difference]: Without dead ends: 679 [2019-11-06 22:22:55,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-11-06 22:22:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 651. [2019-11-06 22:22:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-06 22:22:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 936 transitions. [2019-11-06 22:22:55,220 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 936 transitions. Word has length 43 [2019-11-06 22:22:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:55,220 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 936 transitions. [2019-11-06 22:22:55,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 936 transitions. [2019-11-06 22:22:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:22:55,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:55,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:55,222 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:55,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1117549054, now seen corresponding path program 1 times [2019-11-06 22:22:55,222 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:55,222 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246680538] [2019-11-06 22:22:55,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:55,259 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246680538] [2019-11-06 22:22:55,259 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:55,260 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:55,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607575390] [2019-11-06 22:22:55,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:55,261 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:55,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:55,261 INFO L87 Difference]: Start difference. First operand 651 states and 936 transitions. Second operand 5 states. [2019-11-06 22:22:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:55,483 INFO L93 Difference]: Finished difference Result 1357 states and 1942 transitions. [2019-11-06 22:22:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:55,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-06 22:22:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:55,487 INFO L225 Difference]: With dead ends: 1357 [2019-11-06 22:22:55,487 INFO L226 Difference]: Without dead ends: 720 [2019-11-06 22:22:55,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-06 22:22:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 714. [2019-11-06 22:22:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-06 22:22:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2019-11-06 22:22:55,531 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 43 [2019-11-06 22:22:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:55,532 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2019-11-06 22:22:55,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2019-11-06 22:22:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 22:22:55,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:55,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:55,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 150670326, now seen corresponding path program 1 times [2019-11-06 22:22:55,534 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:55,534 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566308643] [2019-11-06 22:22:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:55,580 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566308643] [2019-11-06 22:22:55,580 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:55,580 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:55,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32339225] [2019-11-06 22:22:55,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:55,581 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:55,582 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand 5 states. [2019-11-06 22:22:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:55,805 INFO L93 Difference]: Finished difference Result 1442 states and 2059 transitions. [2019-11-06 22:22:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:55,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-06 22:22:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:55,809 INFO L225 Difference]: With dead ends: 1442 [2019-11-06 22:22:55,809 INFO L226 Difference]: Without dead ends: 742 [2019-11-06 22:22:55,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-11-06 22:22:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 714. [2019-11-06 22:22:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-06 22:22:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1011 transitions. [2019-11-06 22:22:55,848 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1011 transitions. Word has length 44 [2019-11-06 22:22:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:55,848 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1011 transitions. [2019-11-06 22:22:55,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1011 transitions. [2019-11-06 22:22:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 22:22:55,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:55,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:55,850 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -826101582, now seen corresponding path program 1 times [2019-11-06 22:22:55,850 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:55,850 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486537675] [2019-11-06 22:22:55,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:55,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486537675] [2019-11-06 22:22:55,892 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:55,892 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:55,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219492505] [2019-11-06 22:22:55,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:55,893 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:55,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:55,894 INFO L87 Difference]: Start difference. First operand 714 states and 1011 transitions. Second operand 5 states. [2019-11-06 22:22:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:56,154 INFO L93 Difference]: Finished difference Result 1424 states and 2017 transitions. [2019-11-06 22:22:56,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:56,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-06 22:22:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:56,158 INFO L225 Difference]: With dead ends: 1424 [2019-11-06 22:22:56,158 INFO L226 Difference]: Without dead ends: 724 [2019-11-06 22:22:56,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-06 22:22:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 718. [2019-11-06 22:22:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-11-06 22:22:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1017 transitions. [2019-11-06 22:22:56,200 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1017 transitions. Word has length 44 [2019-11-06 22:22:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:56,200 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1017 transitions. [2019-11-06 22:22:56,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1017 transitions. [2019-11-06 22:22:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 22:22:56,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:56,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:56,202 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 394900860, now seen corresponding path program 1 times [2019-11-06 22:22:56,203 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:56,203 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666114656] [2019-11-06 22:22:56,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:56,240 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666114656] [2019-11-06 22:22:56,240 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:56,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:56,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210557636] [2019-11-06 22:22:56,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:56,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:56,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:56,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:56,243 INFO L87 Difference]: Start difference. First operand 718 states and 1017 transitions. Second operand 5 states. [2019-11-06 22:22:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:56,483 INFO L93 Difference]: Finished difference Result 1491 states and 2102 transitions. [2019-11-06 22:22:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:56,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-06 22:22:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:56,488 INFO L225 Difference]: With dead ends: 1491 [2019-11-06 22:22:56,488 INFO L226 Difference]: Without dead ends: 787 [2019-11-06 22:22:56,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-11-06 22:22:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2019-11-06 22:22:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-11-06 22:22:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1100 transitions. [2019-11-06 22:22:56,536 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1100 transitions. Word has length 45 [2019-11-06 22:22:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:56,536 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1100 transitions. [2019-11-06 22:22:56,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1100 transitions. [2019-11-06 22:22:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:22:56,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:56,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:56,538 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2061317727, now seen corresponding path program 1 times [2019-11-06 22:22:56,538 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:56,539 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459747971] [2019-11-06 22:22:56,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:56,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459747971] [2019-11-06 22:22:56,577 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:56,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:56,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203545394] [2019-11-06 22:22:56,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:56,578 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:56,579 INFO L87 Difference]: Start difference. First operand 785 states and 1100 transitions. Second operand 5 states. [2019-11-06 22:22:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:56,805 INFO L93 Difference]: Finished difference Result 1570 states and 2201 transitions. [2019-11-06 22:22:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:56,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:22:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:56,809 INFO L225 Difference]: With dead ends: 1570 [2019-11-06 22:22:56,809 INFO L226 Difference]: Without dead ends: 799 [2019-11-06 22:22:56,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-06 22:22:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 789. [2019-11-06 22:22:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-06 22:22:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1106 transitions. [2019-11-06 22:22:56,858 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1106 transitions. Word has length 47 [2019-11-06 22:22:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1106 transitions. [2019-11-06 22:22:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1106 transitions. [2019-11-06 22:22:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:22:56,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:56,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:56,860 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2062397286, now seen corresponding path program 1 times [2019-11-06 22:22:56,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:56,861 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732798547] [2019-11-06 22:22:56,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:56,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-11-06 22:22:56,906 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732798547] [2019-11-06 22:22:56,906 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:56,906 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:56,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65519093] [2019-11-06 22:22:56,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:56,907 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:56,908 INFO L87 Difference]: Start difference. First operand 789 states and 1106 transitions. Second operand 5 states. [2019-11-06 22:22:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:57,209 INFO L93 Difference]: Finished difference Result 1659 states and 2324 transitions. [2019-11-06 22:22:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:57,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:22:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:57,214 INFO L225 Difference]: With dead ends: 1659 [2019-11-06 22:22:57,214 INFO L226 Difference]: Without dead ends: 884 [2019-11-06 22:22:57,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-11-06 22:22:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 870. [2019-11-06 22:22:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-06 22:22:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1213 transitions. [2019-11-06 22:22:57,264 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1213 transitions. Word has length 47 [2019-11-06 22:22:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:57,264 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1213 transitions. [2019-11-06 22:22:57,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1213 transitions. [2019-11-06 22:22:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 22:22:57,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:57,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:57,269 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1357130696, now seen corresponding path program 1 times [2019-11-06 22:22:57,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:57,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819401934] [2019-11-06 22:22:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:57,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819401934] [2019-11-06 22:22:57,317 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:57,317 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:57,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715479994] [2019-11-06 22:22:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:57,319 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:57,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:57,320 INFO L87 Difference]: Start difference. First operand 870 states and 1213 transitions. Second operand 5 states. [2019-11-06 22:22:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:57,542 INFO L93 Difference]: Finished difference Result 1738 states and 2423 transitions. [2019-11-06 22:22:57,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:57,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-06 22:22:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:57,547 INFO L225 Difference]: With dead ends: 1738 [2019-11-06 22:22:57,547 INFO L226 Difference]: Without dead ends: 882 [2019-11-06 22:22:57,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-11-06 22:22:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2019-11-06 22:22:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-06 22:22:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1213 transitions. [2019-11-06 22:22:57,596 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1213 transitions. Word has length 48 [2019-11-06 22:22:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:57,596 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1213 transitions. [2019-11-06 22:22:57,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1213 transitions. [2019-11-06 22:22:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 22:22:57,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:57,598 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:57,598 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -393720600, now seen corresponding path program 1 times [2019-11-06 22:22:57,598 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:57,599 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85335101] [2019-11-06 22:22:57,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:57,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85335101] [2019-11-06 22:22:57,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:57,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:57,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651315599] [2019-11-06 22:22:57,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:57,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:57,643 INFO L87 Difference]: Start difference. First operand 872 states and 1213 transitions. Second operand 5 states. [2019-11-06 22:22:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:57,878 INFO L93 Difference]: Finished difference Result 1811 states and 2508 transitions. [2019-11-06 22:22:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:57,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-06 22:22:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:57,883 INFO L225 Difference]: With dead ends: 1811 [2019-11-06 22:22:57,883 INFO L226 Difference]: Without dead ends: 953 [2019-11-06 22:22:57,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-11-06 22:22:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 947. [2019-11-06 22:22:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-06 22:22:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1304 transitions. [2019-11-06 22:22:57,955 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1304 transitions. Word has length 48 [2019-11-06 22:22:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:57,955 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1304 transitions. [2019-11-06 22:22:57,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1304 transitions. [2019-11-06 22:22:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 22:22:57,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:57,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:57,957 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1882441225, now seen corresponding path program 1 times [2019-11-06 22:22:57,958 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:57,958 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505643] [2019-11-06 22:22:57,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:58,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505643] [2019-11-06 22:22:58,010 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:58,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313708306] [2019-11-06 22:22:58,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:58,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:58,011 INFO L87 Difference]: Start difference. First operand 947 states and 1304 transitions. Second operand 5 states. [2019-11-06 22:22:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,253 INFO L93 Difference]: Finished difference Result 1904 states and 2631 transitions. [2019-11-06 22:22:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:58,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-06 22:22:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,263 INFO L225 Difference]: With dead ends: 1904 [2019-11-06 22:22:58,263 INFO L226 Difference]: Without dead ends: 971 [2019-11-06 22:22:58,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-11-06 22:22:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 957. [2019-11-06 22:22:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-06 22:22:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1322 transitions. [2019-11-06 22:22:58,311 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1322 transitions. Word has length 48 [2019-11-06 22:22:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,312 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1322 transitions. [2019-11-06 22:22:58,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1322 transitions. [2019-11-06 22:22:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 22:22:58,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,313 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash -368829041, now seen corresponding path program 1 times [2019-11-06 22:22:58,314 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,314 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916153288] [2019-11-06 22:22:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:58,358 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916153288] [2019-11-06 22:22:58,358 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,358 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:58,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268872616] [2019-11-06 22:22:58,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:58,360 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:58,361 INFO L87 Difference]: Start difference. First operand 957 states and 1322 transitions. Second operand 5 states. [2019-11-06 22:22:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,581 INFO L93 Difference]: Finished difference Result 1906 states and 2631 transitions. [2019-11-06 22:22:58,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:58,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-06 22:22:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,586 INFO L225 Difference]: With dead ends: 1906 [2019-11-06 22:22:58,587 INFO L226 Difference]: Without dead ends: 963 [2019-11-06 22:22:58,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-06 22:22:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 957. [2019-11-06 22:22:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-06 22:22:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1318 transitions. [2019-11-06 22:22:58,634 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1318 transitions. Word has length 49 [2019-11-06 22:22:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,635 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1318 transitions. [2019-11-06 22:22:58,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1318 transitions. [2019-11-06 22:22:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 22:22:58,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,636 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267133, now seen corresponding path program 1 times [2019-11-06 22:22:58,637 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975174521] [2019-11-06 22:22:58,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:58,678 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975174521] [2019-11-06 22:22:58,678 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,678 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:58,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389167040] [2019-11-06 22:22:58,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:58,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:58,679 INFO L87 Difference]: Start difference. First operand 957 states and 1318 transitions. Second operand 5 states. [2019-11-06 22:22:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,918 INFO L93 Difference]: Finished difference Result 1983 states and 2718 transitions. [2019-11-06 22:22:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:58,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-06 22:22:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,924 INFO L225 Difference]: With dead ends: 1983 [2019-11-06 22:22:58,924 INFO L226 Difference]: Without dead ends: 1040 [2019-11-06 22:22:58,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-06 22:22:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-11-06 22:22:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-06 22:22:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1409 transitions. [2019-11-06 22:22:58,989 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1409 transitions. Word has length 50 [2019-11-06 22:22:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,989 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1409 transitions. [2019-11-06 22:22:58,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1409 transitions. [2019-11-06 22:22:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 22:22:58,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,990 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 36294858, now seen corresponding path program 1 times [2019-11-06 22:22:58,991 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290343584] [2019-11-06 22:22:58,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:59,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290343584] [2019-11-06 22:22:59,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,027 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:59,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446983440] [2019-11-06 22:22:59,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:59,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:59,028 INFO L87 Difference]: Start difference. First operand 1034 states and 1409 transitions. Second operand 5 states. [2019-11-06 22:22:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,263 INFO L93 Difference]: Finished difference Result 2060 states and 2805 transitions. [2019-11-06 22:22:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:59,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-06 22:22:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,268 INFO L225 Difference]: With dead ends: 2060 [2019-11-06 22:22:59,268 INFO L226 Difference]: Without dead ends: 1040 [2019-11-06 22:22:59,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-06 22:22:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1034. [2019-11-06 22:22:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-06 22:22:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1405 transitions. [2019-11-06 22:22:59,318 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1405 transitions. Word has length 51 [2019-11-06 22:22:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,318 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1405 transitions. [2019-11-06 22:22:59,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1405 transitions. [2019-11-06 22:22:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-06 22:22:59,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,320 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:59,320 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1896340220, now seen corresponding path program 1 times [2019-11-06 22:22:59,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,323 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596279676] [2019-11-06 22:22:59,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:59,352 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596279676] [2019-11-06 22:22:59,352 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,352 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:59,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118356887] [2019-11-06 22:22:59,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:59,353 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,353 INFO L87 Difference]: Start difference. First operand 1034 states and 1405 transitions. Second operand 3 states. [2019-11-06 22:22:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,406 INFO L93 Difference]: Finished difference Result 2054 states and 2792 transitions. [2019-11-06 22:22:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:59,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-06 22:22:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,410 INFO L225 Difference]: With dead ends: 2054 [2019-11-06 22:22:59,411 INFO L226 Difference]: Without dead ends: 1034 [2019-11-06 22:22:59,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-11-06 22:22:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-11-06 22:22:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-06 22:22:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1378 transitions. [2019-11-06 22:22:59,462 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1378 transitions. Word has length 54 [2019-11-06 22:22:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,463 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1378 transitions. [2019-11-06 22:22:59,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1378 transitions. [2019-11-06 22:22:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 22:22:59,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,464 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:59,465 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1048271307, now seen corresponding path program 1 times [2019-11-06 22:22:59,465 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,465 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862425772] [2019-11-06 22:22:59,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:59,490 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862425772] [2019-11-06 22:22:59,490 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,490 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:59,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984773563] [2019-11-06 22:22:59,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:59,491 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,492 INFO L87 Difference]: Start difference. First operand 1034 states and 1378 transitions. Second operand 3 states. [2019-11-06 22:22:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,551 INFO L93 Difference]: Finished difference Result 2072 states and 2760 transitions. [2019-11-06 22:22:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:59,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-06 22:22:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,556 INFO L225 Difference]: With dead ends: 2072 [2019-11-06 22:22:59,556 INFO L226 Difference]: Without dead ends: 1052 [2019-11-06 22:22:59,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-06 22:22:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-11-06 22:22:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-11-06 22:22:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1369 transitions. [2019-11-06 22:22:59,615 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1369 transitions. Word has length 55 [2019-11-06 22:22:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,615 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1369 transitions. [2019-11-06 22:22:59,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1369 transitions. [2019-11-06 22:22:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 22:22:59,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:59,617 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1564495280, now seen corresponding path program 1 times [2019-11-06 22:22:59,618 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,618 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566065422] [2019-11-06 22:22:59,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:59,700 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566065422] [2019-11-06 22:22:59,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:59,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952024969] [2019-11-06 22:22:59,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:59,701 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:59,702 INFO L87 Difference]: Start difference. First operand 1046 states and 1369 transitions. Second operand 5 states. [2019-11-06 22:22:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,979 INFO L93 Difference]: Finished difference Result 2175 states and 2835 transitions. [2019-11-06 22:22:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:59,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-06 22:22:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,984 INFO L225 Difference]: With dead ends: 2175 [2019-11-06 22:22:59,984 INFO L226 Difference]: Without dead ends: 1143 [2019-11-06 22:22:59,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-11-06 22:23:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1131. [2019-11-06 22:23:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-06 22:23:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1451 transitions. [2019-11-06 22:23:00,038 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1451 transitions. Word has length 57 [2019-11-06 22:23:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1451 transitions. [2019-11-06 22:23:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1451 transitions. [2019-11-06 22:23:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 22:23:00,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:00,040 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -928520343, now seen corresponding path program 1 times [2019-11-06 22:23:00,041 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055691157] [2019-11-06 22:23:00,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:00,084 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055691157] [2019-11-06 22:23:00,084 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,084 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758097790] [2019-11-06 22:23:00,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,085 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,085 INFO L87 Difference]: Start difference. First operand 1131 states and 1451 transitions. Second operand 5 states. [2019-11-06 22:23:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,332 INFO L93 Difference]: Finished difference Result 2266 states and 2910 transitions. [2019-11-06 22:23:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:00,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-06 22:23:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,337 INFO L225 Difference]: With dead ends: 2266 [2019-11-06 22:23:00,338 INFO L226 Difference]: Without dead ends: 1149 [2019-11-06 22:23:00,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-11-06 22:23:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1135. [2019-11-06 22:23:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-11-06 22:23:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1456 transitions. [2019-11-06 22:23:00,395 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1456 transitions. Word has length 58 [2019-11-06 22:23:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,396 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 1456 transitions. [2019-11-06 22:23:00,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1456 transitions. [2019-11-06 22:23:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 22:23:00,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:00,398 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash 332165990, now seen corresponding path program 1 times [2019-11-06 22:23:00,398 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,399 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525940169] [2019-11-06 22:23:00,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:00,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525940169] [2019-11-06 22:23:00,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,444 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939456201] [2019-11-06 22:23:00,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,445 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,445 INFO L87 Difference]: Start difference. First operand 1135 states and 1456 transitions. Second operand 5 states. [2019-11-06 22:23:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,695 INFO L93 Difference]: Finished difference Result 2357 states and 3013 transitions. [2019-11-06 22:23:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:00,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-06 22:23:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,701 INFO L225 Difference]: With dead ends: 2357 [2019-11-06 22:23:00,701 INFO L226 Difference]: Without dead ends: 1236 [2019-11-06 22:23:00,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-06 22:23:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1224. [2019-11-06 22:23:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-06 22:23:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1556 transitions. [2019-11-06 22:23:00,789 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1556 transitions. Word has length 59 [2019-11-06 22:23:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,789 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1556 transitions. [2019-11-06 22:23:00,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1556 transitions. [2019-11-06 22:23:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:23:00,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,790 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:00,791 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1890648705, now seen corresponding path program 1 times [2019-11-06 22:23:00,791 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852546247] [2019-11-06 22:23:00,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:00,823 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852546247] [2019-11-06 22:23:00,823 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:00,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025672497] [2019-11-06 22:23:00,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:00,824 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:00,825 INFO L87 Difference]: Start difference. First operand 1224 states and 1556 transitions. Second operand 3 states. [2019-11-06 22:23:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,924 INFO L93 Difference]: Finished difference Result 3630 states and 4604 transitions. [2019-11-06 22:23:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:00,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:23:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,933 INFO L225 Difference]: With dead ends: 3630 [2019-11-06 22:23:00,933 INFO L226 Difference]: Without dead ends: 2420 [2019-11-06 22:23:00,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-11-06 22:23:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1840. [2019-11-06 22:23:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-11-06 22:23:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2331 transitions. [2019-11-06 22:23:01,012 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2331 transitions. Word has length 60 [2019-11-06 22:23:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,012 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 2331 transitions. [2019-11-06 22:23:01,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2331 transitions. [2019-11-06 22:23:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:23:01,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:01,014 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1918883551, now seen corresponding path program 1 times [2019-11-06 22:23:01,015 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,015 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523827840] [2019-11-06 22:23:01,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:01,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523827840] [2019-11-06 22:23:01,055 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,056 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:01,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290058724] [2019-11-06 22:23:01,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:01,056 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:01,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:01,057 INFO L87 Difference]: Start difference. First operand 1840 states and 2331 transitions. Second operand 5 states. [2019-11-06 22:23:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:01,347 INFO L93 Difference]: Finished difference Result 3688 states and 4677 transitions. [2019-11-06 22:23:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:01,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-06 22:23:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:01,363 INFO L225 Difference]: With dead ends: 3688 [2019-11-06 22:23:01,363 INFO L226 Difference]: Without dead ends: 1788 [2019-11-06 22:23:01,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-11-06 22:23:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1771. [2019-11-06 22:23:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-06 22:23:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2226 transitions. [2019-11-06 22:23:01,484 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2226 transitions. Word has length 60 [2019-11-06 22:23:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,485 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2226 transitions. [2019-11-06 22:23:01,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2226 transitions. [2019-11-06 22:23:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:23:01,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,486 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:01,487 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1409568447, now seen corresponding path program 1 times [2019-11-06 22:23:01,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600792926] [2019-11-06 22:23:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-06 22:23:01,519 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600792926] [2019-11-06 22:23:01,519 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,519 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:01,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908804151] [2019-11-06 22:23:01,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:01,520 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:01,520 INFO L87 Difference]: Start difference. First operand 1771 states and 2226 transitions. Second operand 3 states. [2019-11-06 22:23:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:01,773 INFO L93 Difference]: Finished difference Result 3545 states and 4460 transitions. [2019-11-06 22:23:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:01,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:23:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:01,784 INFO L225 Difference]: With dead ends: 3545 [2019-11-06 22:23:01,784 INFO L226 Difference]: Without dead ends: 1789 [2019-11-06 22:23:01,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-11-06 22:23:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1771. [2019-11-06 22:23:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-06 22:23:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2221 transitions. [2019-11-06 22:23:01,871 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2221 transitions. Word has length 60 [2019-11-06 22:23:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,871 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2221 transitions. [2019-11-06 22:23:01,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2221 transitions. [2019-11-06 22:23:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:23:01,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:01,877 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2089626817, now seen corresponding path program 1 times [2019-11-06 22:23:01,877 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,877 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123904073] [2019-11-06 22:23:01,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:23:01,912 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123904073] [2019-11-06 22:23:01,912 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:01,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078528499] [2019-11-06 22:23:01,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:01,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:01,915 INFO L87 Difference]: Start difference. First operand 1771 states and 2221 transitions. Second operand 3 states. [2019-11-06 22:23:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,050 INFO L93 Difference]: Finished difference Result 3492 states and 4355 transitions. [2019-11-06 22:23:02,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:02,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:23:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,059 INFO L225 Difference]: With dead ends: 3492 [2019-11-06 22:23:02,060 INFO L226 Difference]: Without dead ends: 2328 [2019-11-06 22:23:02,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-11-06 22:23:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 1763. [2019-11-06 22:23:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-11-06 22:23:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2196 transitions. [2019-11-06 22:23:02,190 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2196 transitions. Word has length 60 [2019-11-06 22:23:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,191 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2196 transitions. [2019-11-06 22:23:02,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2196 transitions. [2019-11-06 22:23:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 22:23:02,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,193 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:02,193 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1796569389, now seen corresponding path program 1 times [2019-11-06 22:23:02,194 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,194 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105995718] [2019-11-06 22:23:02,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:02,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105995718] [2019-11-06 22:23:02,251 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:02,251 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661492746] [2019-11-06 22:23:02,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:02,252 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:02,252 INFO L87 Difference]: Start difference. First operand 1763 states and 2196 transitions. Second operand 3 states. [2019-11-06 22:23:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,475 INFO L93 Difference]: Finished difference Result 5220 states and 6468 transitions. [2019-11-06 22:23:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:02,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-06 22:23:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,482 INFO L225 Difference]: With dead ends: 5220 [2019-11-06 22:23:02,482 INFO L226 Difference]: Without dead ends: 3472 [2019-11-06 22:23:02,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-11-06 22:23:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3470. [2019-11-06 22:23:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3470 states. [2019-11-06 22:23:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4239 transitions. [2019-11-06 22:23:02,641 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4239 transitions. Word has length 61 [2019-11-06 22:23:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,642 INFO L462 AbstractCegarLoop]: Abstraction has 3470 states and 4239 transitions. [2019-11-06 22:23:02,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4239 transitions. [2019-11-06 22:23:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-06 22:23:02,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,643 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:02,644 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425408, now seen corresponding path program 1 times [2019-11-06 22:23:02,644 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,644 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161438198] [2019-11-06 22:23:02,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 22:23:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 22:23:02,705 INFO L172 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-06 22:23:02,705 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-06 22:23:02,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:02 BoogieIcfgContainer [2019-11-06 22:23:02,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:23:02,796 INFO L168 Benchmark]: Toolchain (without parser) took 15744.25 ms. Allocated memory was 143.7 MB in the beginning and 475.5 MB in the end (delta: 331.9 MB). Free memory was 101.0 MB in the beginning and 296.9 MB in the end (delta: -195.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,796 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.77 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 176.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,797 INFO L168 Benchmark]: Boogie Preprocessor took 58.48 ms. Allocated memory is still 201.9 MB. Free memory was 176.7 MB in the beginning and 173.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,798 INFO L168 Benchmark]: RCFGBuilder took 926.05 ms. Allocated memory is still 201.9 MB. Free memory was 173.5 MB in the beginning and 121.1 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,798 INFO L168 Benchmark]: TraceAbstraction took 14141.45 ms. Allocated memory was 201.9 MB in the beginning and 475.5 MB in the end (delta: 273.7 MB). Free memory was 120.4 MB in the beginning and 296.9 MB in the end (delta: -176.5 MB). Peak memory consumption was 97.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:23:02,800 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 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 613.77 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 176.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.48 ms. Allocated memory is still 201.9 MB. Free memory was 176.7 MB in the beginning and 173.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 926.05 ms. Allocated memory is still 201.9 MB. Free memory was 173.5 MB in the beginning and 121.1 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14141.45 ms. Allocated memory was 201.9 MB in the beginning and 475.5 MB in the end (delta: 273.7 MB). Free memory was 120.4 MB in the beginning and 296.9 MB in the end (delta: -176.5 MB). Peak memory consumption was 97.2 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.0s, OverallIterations: 42, TraceHistogramMax: 2, AutomataDifference: 9.3s, 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, 307 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3470occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 41 MinimizatonAttempts, 1597 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s 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...