./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1236ee922960b2737aa65707c3f9d27b28eaa4fc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:19:41,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:19:41,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:19:41,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:19:41,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:19:41,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:19:41,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:19:41,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:19:41,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:19:41,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:19:41,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:19:41,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:19:41,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:19:41,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:19:41,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:19:41,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:19:41,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:19:41,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:19:41,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:19:41,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:19:41,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:19:41,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:19:41,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:19:41,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:19:41,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:19:41,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:19:41,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:19:41,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:19:41,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:19:41,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:19:41,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:19:41,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:19:41,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:19:41,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:19:41,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:19:41,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:19:41,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 09:19:41,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:19:41,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:19:41,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:19:41,915 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:19:41,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:19:41,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:19:41,915 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:19:41,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:19:41,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:19:41,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:19:41,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:19:41,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:19:41,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-11-10 09:19:41,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:19:41,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:19:41,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:19:41,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:19:41,953 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:19:41,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 09:19:41,988 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/data/074d09c3c/4e81ac22f7234937b0dd5ea0e5b32c3c/FLAGeb20a3c03 [2018-11-10 09:19:42,300 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:19:42,301 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 09:19:42,308 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/data/074d09c3c/4e81ac22f7234937b0dd5ea0e5b32c3c/FLAGeb20a3c03 [2018-11-10 09:19:42,320 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/data/074d09c3c/4e81ac22f7234937b0dd5ea0e5b32c3c [2018-11-10 09:19:42,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:19:42,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 09:19:42,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:19:42,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:19:42,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:19:42,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d98d4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42, skipping insertion in model container [2018-11-10 09:19:42,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:19:42,360 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:19:42,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:19:42,491 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:19:42,521 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:19:42,529 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:19:42,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42 WrapperNode [2018-11-10 09:19:42,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:19:42,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:19:42,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:19:42,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:19:42,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... [2018-11-10 09:19:42,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:19:42,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:19:42,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:19:42,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:19:42,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/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 [2018-11-10 09:19:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:19:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:19:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 09:19:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:19:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 09:19:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:19:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:19:42,742 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:19:42,743 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:19:43,065 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:19:43,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:43 BoogieIcfgContainer [2018-11-10 09:19:43,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:19:43,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:19:43,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:19:43,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:19:43,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:19:42" (1/3) ... [2018-11-10 09:19:43,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7582c62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:19:43, skipping insertion in model container [2018-11-10 09:19:43,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:19:42" (2/3) ... [2018-11-10 09:19:43,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7582c62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:19:43, skipping insertion in model container [2018-11-10 09:19:43,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:43" (3/3) ... [2018-11-10 09:19:43,072 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 09:19:43,080 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:19:43,086 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:19:43,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:19:43,123 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:19:43,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:19:43,123 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:19:43,124 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:19:43,124 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:19:43,124 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:19:43,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:19:43,124 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:19:43,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:19:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-10 09:19:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:19:43,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:43,144 INFO L375 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] [2018-11-10 09:19:43,146 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-11-10 09:19:43,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:43,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:43,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:43,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:43,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:43,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:43,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,318 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-10 09:19:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:43,391 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-10 09:19:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:43,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 09:19:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:43,401 INFO L225 Difference]: With dead ends: 380 [2018-11-10 09:19:43,401 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 09:19:43,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 09:19:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-10 09:19:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 09:19:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-10 09:19:43,445 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-10 09:19:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:43,446 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-10 09:19:43,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-10 09:19:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:19:43,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:43,447 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 09:19:43,448 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:43,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash -181947221, now seen corresponding path program 1 times [2018-11-10 09:19:43,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:43,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:19:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:43,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,503 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-10 09:19:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:43,627 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-11-10 09:19:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:43,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 09:19:43,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:43,629 INFO L225 Difference]: With dead ends: 476 [2018-11-10 09:19:43,630 INFO L226 Difference]: Without dead ends: 266 [2018-11-10 09:19:43,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-10 09:19:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-11-10 09:19:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 09:19:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-10 09:19:43,647 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-10 09:19:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:43,648 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-10 09:19:43,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-10 09:19:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:19:43,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:43,651 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:43,651 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:43,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash 4190327, now seen corresponding path program 1 times [2018-11-10 09:19:43,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:43,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:19:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:43,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,719 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-10 09:19:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:43,846 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-11-10 09:19:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:43,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 09:19:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:43,848 INFO L225 Difference]: With dead ends: 608 [2018-11-10 09:19:43,849 INFO L226 Difference]: Without dead ends: 360 [2018-11-10 09:19:43,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-10 09:19:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-11-10 09:19:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-10 09:19:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-11-10 09:19:43,866 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-11-10 09:19:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:43,867 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-11-10 09:19:43,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-11-10 09:19:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:19:43,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:43,870 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:43,870 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:43,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -129823179, now seen corresponding path program 1 times [2018-11-10 09:19:43,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:43,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:19:43,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:43,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:43,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:43,923 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-11-10 09:19:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,054 INFO L93 Difference]: Finished difference Result 722 states and 1019 transitions. [2018-11-10 09:19:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 09:19:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,056 INFO L225 Difference]: With dead ends: 722 [2018-11-10 09:19:44,057 INFO L226 Difference]: Without dead ends: 392 [2018-11-10 09:19:44,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-10 09:19:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2018-11-10 09:19:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 09:19:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-10 09:19:44,071 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-10 09:19:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,072 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-10 09:19:44,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-10 09:19:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 09:19:44,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,074 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,074 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -989482404, now seen corresponding path program 1 times [2018-11-10 09:19:44,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:19:44,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,121 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-10 09:19:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,286 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-10 09:19:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 09:19:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,290 INFO L225 Difference]: With dead ends: 860 [2018-11-10 09:19:44,290 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 09:19:44,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 09:19:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-10 09:19:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-10 09:19:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-10 09:19:44,301 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-10 09:19:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,301 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-10 09:19:44,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-10 09:19:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 09:19:44,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,303 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,303 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash 761709011, now seen corresponding path program 1 times [2018-11-10 09:19:44,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 09:19:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,341 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-10 09:19:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,436 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-10 09:19:44,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 09:19:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,438 INFO L225 Difference]: With dead ends: 962 [2018-11-10 09:19:44,439 INFO L226 Difference]: Without dead ends: 512 [2018-11-10 09:19:44,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-10 09:19:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-10 09:19:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-10 09:19:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-10 09:19:44,454 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-10 09:19:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,455 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-10 09:19:44,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-10 09:19:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 09:19:44,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,457 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,457 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1138758815, now seen corresponding path program 1 times [2018-11-10 09:19:44,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 09:19:44,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,522 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-10 09:19:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,674 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-11-10 09:19:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 09:19:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,683 INFO L225 Difference]: With dead ends: 1106 [2018-11-10 09:19:44,684 INFO L226 Difference]: Without dead ends: 608 [2018-11-10 09:19:44,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-10 09:19:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-11-10 09:19:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 09:19:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-11-10 09:19:44,697 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-11-10 09:19:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,697 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-11-10 09:19:44,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-11-10 09:19:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 09:19:44,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,699 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,699 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1004745309, now seen corresponding path program 1 times [2018-11-10 09:19:44,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:19:44,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,736 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-11-10 09:19:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,761 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-11-10 09:19:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 09:19:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,765 INFO L225 Difference]: With dead ends: 1612 [2018-11-10 09:19:44,765 INFO L226 Difference]: Without dead ends: 1036 [2018-11-10 09:19:44,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-10 09:19:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-11-10 09:19:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-10 09:19:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-11-10 09:19:44,789 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-11-10 09:19:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,789 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-11-10 09:19:44,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-11-10 09:19:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 09:19:44,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,791 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,791 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -699194411, now seen corresponding path program 1 times [2018-11-10 09:19:44,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 09:19:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,824 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-11-10 09:19:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:44,861 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-11-10 09:19:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:44,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 09:19:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:44,866 INFO L225 Difference]: With dead ends: 2056 [2018-11-10 09:19:44,867 INFO L226 Difference]: Without dead ends: 1544 [2018-11-10 09:19:44,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-10 09:19:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-11-10 09:19:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-10 09:19:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-11-10 09:19:44,899 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-11-10 09:19:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:44,899 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-11-10 09:19:44,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-11-10 09:19:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 09:19:44,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:44,901 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:44,901 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:44,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1407168417, now seen corresponding path program 1 times [2018-11-10 09:19:44,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:44,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 09:19:44,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:44,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:44,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:44,956 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-11-10 09:19:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:45,008 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-11-10 09:19:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:45,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-10 09:19:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:45,016 INFO L225 Difference]: With dead ends: 2056 [2018-11-10 09:19:45,016 INFO L226 Difference]: Without dead ends: 2054 [2018-11-10 09:19:45,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-10 09:19:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-11-10 09:19:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-11-10 09:19:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-11-10 09:19:45,060 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-11-10 09:19:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:45,060 INFO L481 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-11-10 09:19:45,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-11-10 09:19:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 09:19:45,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:45,065 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 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] [2018-11-10 09:19:45,065 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:45,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash 245134098, now seen corresponding path program 1 times [2018-11-10 09:19:45,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:45,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-10 09:19:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:45,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,123 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-11-10 09:19:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:45,267 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-11-10 09:19:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:45,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-11-10 09:19:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:45,275 INFO L225 Difference]: With dead ends: 4504 [2018-11-10 09:19:45,275 INFO L226 Difference]: Without dead ends: 2446 [2018-11-10 09:19:45,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-11-10 09:19:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-11-10 09:19:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-11-10 09:19:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-11-10 09:19:45,328 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 177 [2018-11-10 09:19:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:45,329 INFO L481 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-11-10 09:19:45,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-11-10 09:19:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 09:19:45,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:45,333 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:45,333 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:45,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash 63820289, now seen corresponding path program 1 times [2018-11-10 09:19:45,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:45,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:45,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-10 09:19:45,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:45,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:45,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,410 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-11-10 09:19:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:45,535 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-11-10 09:19:45,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:45,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-10 09:19:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:45,543 INFO L225 Difference]: With dead ends: 4874 [2018-11-10 09:19:45,544 INFO L226 Difference]: Without dead ends: 2552 [2018-11-10 09:19:45,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-11-10 09:19:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-11-10 09:19:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-11-10 09:19:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-11-10 09:19:45,613 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 214 [2018-11-10 09:19:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:45,614 INFO L481 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-11-10 09:19:45,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-11-10 09:19:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-10 09:19:45,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:45,620 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:45,620 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:45,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:45,620 INFO L82 PathProgramCache]: Analyzing trace with hash -904582351, now seen corresponding path program 1 times [2018-11-10 09:19:45,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:45,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-10 09:19:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:45,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,706 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-11-10 09:19:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:45,823 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-11-10 09:19:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:45,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-11-10 09:19:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:45,831 INFO L225 Difference]: With dead ends: 5272 [2018-11-10 09:19:45,831 INFO L226 Difference]: Without dead ends: 2758 [2018-11-10 09:19:45,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-10 09:19:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-11-10 09:19:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-11-10 09:19:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-11-10 09:19:45,889 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 236 [2018-11-10 09:19:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:45,889 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-11-10 09:19:45,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-11-10 09:19:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 09:19:45,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:45,895 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:45,895 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:45,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -77853786, now seen corresponding path program 1 times [2018-11-10 09:19:45,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-10 09:19:45,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:45,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:45,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:45,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:45,966 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-11-10 09:19:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:46,068 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-11-10 09:19:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:46,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 09:19:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:46,077 INFO L225 Difference]: With dead ends: 5704 [2018-11-10 09:19:46,077 INFO L226 Difference]: Without dead ends: 2982 [2018-11-10 09:19:46,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-11-10 09:19:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-11-10 09:19:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-10 09:19:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-11-10 09:19:46,136 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 261 [2018-11-10 09:19:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:46,137 INFO L481 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-11-10 09:19:46,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-11-10 09:19:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 09:19:46,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:46,143 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:46,143 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:46,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1695294236, now seen corresponding path program 1 times [2018-11-10 09:19:46,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:46,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-10 09:19:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:46,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,211 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-11-10 09:19:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:46,325 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-11-10 09:19:46,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:46,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 09:19:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:46,334 INFO L225 Difference]: With dead ends: 6200 [2018-11-10 09:19:46,334 INFO L226 Difference]: Without dead ends: 3246 [2018-11-10 09:19:46,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-10 09:19:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-11-10 09:19:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-11-10 09:19:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-11-10 09:19:46,402 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 261 [2018-11-10 09:19:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:46,403 INFO L481 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-11-10 09:19:46,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-11-10 09:19:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 09:19:46,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:46,410 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:46,411 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:46,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash 980064386, now seen corresponding path program 1 times [2018-11-10 09:19:46,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:46,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-10 09:19:46,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:46,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:46,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:46,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,518 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-11-10 09:19:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:46,586 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-11-10 09:19:46,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:46,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-11-10 09:19:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:46,602 INFO L225 Difference]: With dead ends: 9346 [2018-11-10 09:19:46,602 INFO L226 Difference]: Without dead ends: 6136 [2018-11-10 09:19:46,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-11-10 09:19:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-11-10 09:19:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-11-10 09:19:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-11-10 09:19:46,698 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 292 [2018-11-10 09:19:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:46,698 INFO L481 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-11-10 09:19:46,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-11-10 09:19:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 09:19:46,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:46,708 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:46,708 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:46,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash -637376064, now seen corresponding path program 1 times [2018-11-10 09:19:46,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:46,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-11-10 09:19:46,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:46,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:46,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:46,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,793 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-11-10 09:19:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:46,921 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-11-10 09:19:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:46,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-11-10 09:19:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:46,934 INFO L225 Difference]: With dead ends: 12864 [2018-11-10 09:19:46,934 INFO L226 Difference]: Without dead ends: 6742 [2018-11-10 09:19:46,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-10 09:19:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-11-10 09:19:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-10 09:19:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-11-10 09:19:46,999 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 292 [2018-11-10 09:19:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:47,000 INFO L481 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-11-10 09:19:47,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-11-10 09:19:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-10 09:19:47,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:47,007 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:47,007 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:47,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash -320485772, now seen corresponding path program 1 times [2018-11-10 09:19:47,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-11-10 09:19:47,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:47,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:47,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,096 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-11-10 09:19:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:47,213 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-11-10 09:19:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:47,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-11-10 09:19:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:47,221 INFO L225 Difference]: With dead ends: 13432 [2018-11-10 09:19:47,221 INFO L226 Difference]: Without dead ends: 6734 [2018-11-10 09:19:47,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-11-10 09:19:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-11-10 09:19:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-10 09:19:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-11-10 09:19:47,289 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 317 [2018-11-10 09:19:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:47,289 INFO L481 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-11-10 09:19:47,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-11-10 09:19:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 09:19:47,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:47,295 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:47,295 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -123160885, now seen corresponding path program 1 times [2018-11-10 09:19:47,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-10 09:19:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:47,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:47,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,354 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-11-10 09:19:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:47,483 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-11-10 09:19:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:47,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-10 09:19:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:47,492 INFO L225 Difference]: With dead ends: 14208 [2018-11-10 09:19:47,492 INFO L226 Difference]: Without dead ends: 7518 [2018-11-10 09:19:47,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-11-10 09:19:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-11-10 09:19:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-10 09:19:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-11-10 09:19:47,561 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 328 [2018-11-10 09:19:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:47,562 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-11-10 09:19:47,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-11-10 09:19:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-10 09:19:47,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:47,568 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:47,568 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:47,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash -775771687, now seen corresponding path program 1 times [2018-11-10 09:19:47,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-11-10 09:19:47,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:47,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:47,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,647 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-11-10 09:19:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:47,826 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-11-10 09:19:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:47,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2018-11-10 09:19:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:47,838 INFO L225 Difference]: With dead ends: 15496 [2018-11-10 09:19:47,838 INFO L226 Difference]: Without dead ends: 8166 [2018-11-10 09:19:47,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-10 09:19:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-11-10 09:19:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-10 09:19:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-11-10 09:19:47,945 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 343 [2018-11-10 09:19:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:47,946 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-11-10 09:19:47,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-11-10 09:19:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-10 09:19:47,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:47,955 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:47,955 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:47,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1529731646, now seen corresponding path program 1 times [2018-11-10 09:19:47,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:47,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 09:19:48,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:48,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:48,068 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-11-10 09:19:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:48,218 INFO L93 Difference]: Finished difference Result 15176 states and 19730 transitions. [2018-11-10 09:19:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:48,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2018-11-10 09:19:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:48,230 INFO L225 Difference]: With dead ends: 15176 [2018-11-10 09:19:48,230 INFO L226 Difference]: Without dead ends: 7598 [2018-11-10 09:19:48,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-10 09:19:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-11-10 09:19:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-11-10 09:19:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-11-10 09:19:48,334 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 345 [2018-11-10 09:19:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:48,334 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-11-10 09:19:48,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-11-10 09:19:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-10 09:19:48,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:48,342 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:48,342 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:48,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -27462980, now seen corresponding path program 1 times [2018-11-10 09:19:48,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:48,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1595 backedges. 936 proven. 11 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-10 09:19:48,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:48,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:19:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1595 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2018-11-10 09:19:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:19:48,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-10 09:19:48,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:19:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:19:48,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:19:48,761 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 7 states. [2018-11-10 09:19:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:49,337 INFO L93 Difference]: Finished difference Result 17741 states and 22665 transitions. [2018-11-10 09:19:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:19:49,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 368 [2018-11-10 09:19:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:49,352 INFO L225 Difference]: With dead ends: 17741 [2018-11-10 09:19:49,352 INFO L226 Difference]: Without dead ends: 10151 [2018-11-10 09:19:49,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:19:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10151 states. [2018-11-10 09:19:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10151 to 7714. [2018-11-10 09:19:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7714 states. [2018-11-10 09:19:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7714 states to 7714 states and 9800 transitions. [2018-11-10 09:19:49,526 INFO L78 Accepts]: Start accepts. Automaton has 7714 states and 9800 transitions. Word has length 368 [2018-11-10 09:19:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:49,526 INFO L481 AbstractCegarLoop]: Abstraction has 7714 states and 9800 transitions. [2018-11-10 09:19:49,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:19:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7714 states and 9800 transitions. [2018-11-10 09:19:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-10 09:19:49,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:49,538 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:49,539 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:49,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1323422692, now seen corresponding path program 1 times [2018-11-10 09:19:49,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:49,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:49,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 09:19:49,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:49,669 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:19:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:49,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 09:19:49,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:19:49,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:19:49,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:19:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:19:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:19:49,938 INFO L87 Difference]: Start difference. First operand 7714 states and 9800 transitions. Second operand 4 states. [2018-11-10 09:19:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:50,271 INFO L93 Difference]: Finished difference Result 16785 states and 21122 transitions. [2018-11-10 09:19:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:19:50,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-10 09:19:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:50,285 INFO L225 Difference]: With dead ends: 16785 [2018-11-10 09:19:50,285 INFO L226 Difference]: Without dead ends: 9223 [2018-11-10 09:19:50,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:19:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2018-11-10 09:19:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 7482. [2018-11-10 09:19:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7482 states. [2018-11-10 09:19:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7482 states to 7482 states and 9304 transitions. [2018-11-10 09:19:50,420 INFO L78 Accepts]: Start accepts. Automaton has 7482 states and 9304 transitions. Word has length 396 [2018-11-10 09:19:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:50,420 INFO L481 AbstractCegarLoop]: Abstraction has 7482 states and 9304 transitions. [2018-11-10 09:19:50,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:19:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7482 states and 9304 transitions. [2018-11-10 09:19:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-10 09:19:50,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:50,428 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:50,428 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:50,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash 434135575, now seen corresponding path program 1 times [2018-11-10 09:19:50,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:50,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:50,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-10 09:19:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:50,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:50,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:50,541 INFO L87 Difference]: Start difference. First operand 7482 states and 9304 transitions. Second operand 3 states. [2018-11-10 09:19:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:50,700 INFO L93 Difference]: Finished difference Result 13555 states and 16650 transitions. [2018-11-10 09:19:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:50,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-10 09:19:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:50,709 INFO L225 Difference]: With dead ends: 13555 [2018-11-10 09:19:50,709 INFO L226 Difference]: Without dead ends: 5447 [2018-11-10 09:19:50,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2018-11-10 09:19:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5186. [2018-11-10 09:19:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2018-11-10 09:19:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 6315 transitions. [2018-11-10 09:19:50,792 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 6315 transitions. Word has length 436 [2018-11-10 09:19:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:50,793 INFO L481 AbstractCegarLoop]: Abstraction has 5186 states and 6315 transitions. [2018-11-10 09:19:50,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 6315 transitions. [2018-11-10 09:19:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-11-10 09:19:50,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:50,799 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 15, 15, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:50,799 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:50,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash -445787882, now seen corresponding path program 1 times [2018-11-10 09:19:50,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 1545 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-11-10 09:19:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:19:51,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:19:51,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:19:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:19:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:51,010 INFO L87 Difference]: Start difference. First operand 5186 states and 6315 transitions. Second operand 3 states. [2018-11-10 09:19:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:51,098 INFO L93 Difference]: Finished difference Result 9358 states and 11384 transitions. [2018-11-10 09:19:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:19:51,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2018-11-10 09:19:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:51,104 INFO L225 Difference]: With dead ends: 9358 [2018-11-10 09:19:51,105 INFO L226 Difference]: Without dead ends: 4081 [2018-11-10 09:19:51,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:19:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2018-11-10 09:19:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 3638. [2018-11-10 09:19:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3638 states. [2018-11-10 09:19:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 4518 transitions. [2018-11-10 09:19:51,165 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 4518 transitions. Word has length 497 [2018-11-10 09:19:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:51,165 INFO L481 AbstractCegarLoop]: Abstraction has 3638 states and 4518 transitions. [2018-11-10 09:19:51,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:19:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 4518 transitions. [2018-11-10 09:19:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-11-10 09:19:51,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:51,171 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:19:51,171 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:51,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1517504159, now seen corresponding path program 1 times [2018-11-10 09:19:51,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:19:51,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:19:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-11-10 09:19:51,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:51,402 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:19:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:51,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:19:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-11-10 09:19:51,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:19:51,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:19:51,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:19:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:19:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:19:51,724 INFO L87 Difference]: Start difference. First operand 3638 states and 4518 transitions. Second operand 4 states. [2018-11-10 09:19:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:51,896 INFO L93 Difference]: Finished difference Result 4523 states and 5612 transitions. [2018-11-10 09:19:51,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:19:51,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 650 [2018-11-10 09:19:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:51,898 INFO L225 Difference]: With dead ends: 4523 [2018-11-10 09:19:51,898 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:19:51,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:19:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:19:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:19:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:19:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:19:51,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 650 [2018-11-10 09:19:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:51,903 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:19:51,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:19:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:19:51,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:19:51,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:19:51,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:51,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:19:52,435 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 416 DAG size of output: 95 [2018-11-10 09:19:53,304 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-10 09:19:53,345 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-10 09:19:53,345 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-10 09:19:53,345 INFO L421 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-10 09:19:53,346 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L421 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L421 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-10 09:19:53,347 INFO L421 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 0)) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-11-10 09:19:53,347 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L421 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 0)) .cse1) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)))) [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-10 09:19:53,348 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) .cse1))) [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-10 09:19:53,349 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-11-10 09:19:53,350 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__state~0 4560)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (not .cse2)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (= ssl3_connect_~s__state~0 4512)) (.cse1 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4496) .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5 .cse2 .cse6) (and .cse2 (and (= ssl3_connect_~s__state~0 4432) .cse1)) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse8 .cse9 .cse10) (and .cse7 .cse4 .cse10 .cse5) (and .cse7 .cse11) (and .cse11 .cse1 .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and .cse7 (= ssl3_connect_~s__state~0 4400) .cse2) (and .cse3 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse12 .cse3 .cse1 .cse6) (and .cse12 .cse3 .cse10) (and (and (= ssl3_connect_~s__state~0 4448) .cse1) .cse2) (<= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse0) (and .cse1 .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4464) .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4416) .cse1 .cse2)))) [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-10 09:19:53,350 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-11-10 09:19:53,351 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse2) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0))) [2018-11-10 09:19:53,352 INFO L421 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-10 09:19:53,352 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-10 09:19:53,353 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-10 09:19:53,353 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-10 09:19:53,354 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 09:19:53,354 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:19:53,354 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-10 09:19:53,354 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-10 09:19:53,355 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-10 09:19:53,355 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-10 09:19:53,355 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-10 09:19:53,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:19:53 BoogieIcfgContainer [2018-11-10 09:19:53,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:19:53,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:19:53,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:19:53,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:19:53,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:19:43" (3/4) ... [2018-11-10 09:19:53,380 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:19:53,386 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:19:53,386 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 09:19:53,386 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:19:53,394 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 09:19:53,395 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 09:19:53,396 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 09:19:53,420 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-10 09:19:53,420 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-10 09:19:53,420 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 09:19:53,420 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 09:19:53,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 09:19:53,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-10 09:19:53,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || (blastFlag <= 2 && s__state == 4384)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0) [2018-11-10 09:19:53,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) [2018-11-10 09:19:53,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-10 09:19:53,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) [2018-11-10 09:19:53,423 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 0 && 4560 <= s__state) [2018-11-10 09:19:53,423 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-10 09:19:53,476 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35e909de-6f9c-4aa6-8718-c0916a429e1e/bin-2019/uautomizer/witness.graphml [2018-11-10 09:19:53,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:19:53,477 INFO L168 Benchmark]: Toolchain (without parser) took 11154.31 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 865.6 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -224.6 MB). Peak memory consumption was 641.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,477 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:19:53,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 943.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,478 INFO L168 Benchmark]: Boogie Preprocessor took 78.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,478 INFO L168 Benchmark]: RCFGBuilder took 456.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,478 INFO L168 Benchmark]: TraceAbstraction took 10310.15 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 724.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.2 MB). Peak memory consumption was 607.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,479 INFO L168 Benchmark]: Witness Printer took 99.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:19:53,480 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 943.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10310.15 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 724.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.2 MB). Peak memory consumption was 607.8 MB. Max. memory is 11.5 GB. * Witness Printer took 99.82 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || (blastFlag <= 2 && s__state == 4384)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 10.2s OverallTime, 26 OverallIterations, 22 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 5443 SDtfs, 2037 SDslu, 3434 SDs, 0 SdLazy, 2728 SolverSat, 490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7714occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 6024 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 191 NumberOfFragments, 631 HoareAnnotationTreeSize, 26 FomulaSimplifications, 20389 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2037 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 7596 NumberOfCodeBlocks, 7596 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 7567 ConstructedInterpolants, 0 QuantifiedInterpolants, 3454932 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2498 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 32072/32125 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...