./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.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_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/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 9b2fdeede7b1203b845c20c562beaee69c29ce3b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/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 9b2fdeede7b1203b845c20c562beaee69c29ce3b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:59:44,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:59:44,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:59:44,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:59:44,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:59:44,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:59:44,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:59:44,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:59:44,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:59:44,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:59:44,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:59:44,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:59:44,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:59:44,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:59:44,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:59:44,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:59:44,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:59:44,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:59:44,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:59:44,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:59:44,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:59:44,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:59:44,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:59:44,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:59:44,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:59:44,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:59:44,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:59:44,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:59:44,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:59:44,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:59:44,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:59:44,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:59:44,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:59:44,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:59:44,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:59:44,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:59:44,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:59:44,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:59:44,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:59:44,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:59:44,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:59:44,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:59:44,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:59:44,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:59:44,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:59:44,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:59:44,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:59:44,833 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:59:44,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:59:44,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:59:44,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:59:44,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:59:44,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:59:44,834 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:59:44,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:59:44,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:59:44,834 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_217008cf-cefe-46bc-a515-cf1035f3428d/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 -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-11-10 12:59:44,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:59:44,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:59:44,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:59:44,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:59:44,871 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:59:44,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 12:59:44,917 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/dac2fef1d/d735e91a3e3b45a1bf52b14fe790378d/FLAG6a5bfeae1 [2018-11-10 12:59:45,309 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:59:45,310 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 12:59:45,321 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/dac2fef1d/d735e91a3e3b45a1bf52b14fe790378d/FLAG6a5bfeae1 [2018-11-10 12:59:45,330 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/dac2fef1d/d735e91a3e3b45a1bf52b14fe790378d [2018-11-10 12:59:45,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:59:45,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:59:45,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:45,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:59:45,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:59:45,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:45" (1/1) ... [2018-11-10 12:59:45,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b82404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:45, skipping insertion in model container [2018-11-10 12:59:45,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:45" (1/1) ... [2018-11-10 12:59:45,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:59:45,381 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:59:45,776 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:45,784 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:59:46,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:46,073 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:59:46,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46 WrapperNode [2018-11-10 12:59:46,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:46,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:59:46,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:59:46,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:59:46,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... [2018-11-10 12:59:46,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:59:46,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:59:46,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:59:46,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:59:46,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/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 12:59:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 12:59:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-10 12:59:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 12:59:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 12:59:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:59:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:59:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:59:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:59:46,574 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:59:46,574 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:59:47,015 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:59:47,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:47 BoogieIcfgContainer [2018-11-10 12:59:47,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:59:47,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:59:47,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:59:47,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:59:47,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:59:45" (1/3) ... [2018-11-10 12:59:47,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdba6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:47, skipping insertion in model container [2018-11-10 12:59:47,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:46" (2/3) ... [2018-11-10 12:59:47,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdba6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:47, skipping insertion in model container [2018-11-10 12:59:47,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:47" (3/3) ... [2018-11-10 12:59:47,024 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 12:59:47,033 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:59:47,041 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:59:47,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:59:47,090 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:59:47,090 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:59:47,090 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:59:47,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:59:47,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:59:47,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:59:47,091 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:59:47,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:59:47,091 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:59:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states. [2018-11-10 12:59:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 12:59:47,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:47,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:47,124 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:47,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1795904632, now seen corresponding path program 1 times [2018-11-10 12:59:47,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,390 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 12:59:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:47,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:59:47,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:59:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:59:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:59:47,410 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 3 states. [2018-11-10 12:59:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:47,507 INFO L93 Difference]: Finished difference Result 907 states and 1159 transitions. [2018-11-10 12:59:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:59:47,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-11-10 12:59:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:47,524 INFO L225 Difference]: With dead ends: 907 [2018-11-10 12:59:47,524 INFO L226 Difference]: Without dead ends: 555 [2018-11-10 12:59:47,528 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 12:59:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-11-10 12:59:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2018-11-10 12:59:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-11-10 12:59:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 659 transitions. [2018-11-10 12:59:47,579 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 659 transitions. Word has length 93 [2018-11-10 12:59:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:47,580 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 659 transitions. [2018-11-10 12:59:47,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:59:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 659 transitions. [2018-11-10 12:59:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 12:59:47,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:47,584 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:47,585 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1433565775, now seen corresponding path program 1 times [2018-11-10 12:59:47,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:47,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:47,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:47,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:47,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:47,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:47,748 INFO L87 Difference]: Start difference. First operand 555 states and 659 transitions. Second operand 4 states. [2018-11-10 12:59:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:47,943 INFO L93 Difference]: Finished difference Result 865 states and 1040 transitions. [2018-11-10 12:59:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:47,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-10 12:59:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:47,947 INFO L225 Difference]: With dead ends: 865 [2018-11-10 12:59:47,947 INFO L226 Difference]: Without dead ends: 616 [2018-11-10 12:59:47,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-10 12:59:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 586. [2018-11-10 12:59:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-11-10 12:59:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 702 transitions. [2018-11-10 12:59:47,967 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 702 transitions. Word has length 122 [2018-11-10 12:59:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:47,968 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 702 transitions. [2018-11-10 12:59:47,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 702 transitions. [2018-11-10 12:59:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 12:59:47,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:47,971 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:47,971 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:47,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1987639062, now seen corresponding path program 1 times [2018-11-10 12:59:47,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:48,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:48,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:59:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:48,095 INFO L87 Difference]: Start difference. First operand 586 states and 702 transitions. Second operand 6 states. [2018-11-10 12:59:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:48,472 INFO L93 Difference]: Finished difference Result 1225 states and 1489 transitions. [2018-11-10 12:59:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:48,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-11-10 12:59:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:48,475 INFO L225 Difference]: With dead ends: 1225 [2018-11-10 12:59:48,475 INFO L226 Difference]: Without dead ends: 945 [2018-11-10 12:59:48,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-11-10 12:59:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 590. [2018-11-10 12:59:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-10 12:59:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 706 transitions. [2018-11-10 12:59:48,493 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 706 transitions. Word has length 132 [2018-11-10 12:59:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:48,493 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 706 transitions. [2018-11-10 12:59:48,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:59:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 706 transitions. [2018-11-10 12:59:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 12:59:48,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:48,495 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:48,495 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:48,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1252135020, now seen corresponding path program 1 times [2018-11-10 12:59:48,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:48,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:48,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:48,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:48,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:48,588 INFO L87 Difference]: Start difference. First operand 590 states and 706 transitions. Second operand 4 states. [2018-11-10 12:59:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:48,743 INFO L93 Difference]: Finished difference Result 922 states and 1115 transitions. [2018-11-10 12:59:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:48,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-10 12:59:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:48,745 INFO L225 Difference]: With dead ends: 922 [2018-11-10 12:59:48,746 INFO L226 Difference]: Without dead ends: 638 [2018-11-10 12:59:48,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-10 12:59:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 599. [2018-11-10 12:59:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-10 12:59:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 716 transitions. [2018-11-10 12:59:48,754 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 716 transitions. Word has length 150 [2018-11-10 12:59:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:48,754 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 716 transitions. [2018-11-10 12:59:48,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 716 transitions. [2018-11-10 12:59:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 12:59:48,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:48,756 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:48,756 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash -183196953, now seen corresponding path program 1 times [2018-11-10 12:59:48,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:48,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:48,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:48,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:48,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:48,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:48,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:48,832 INFO L87 Difference]: Start difference. First operand 599 states and 716 transitions. Second operand 4 states. [2018-11-10 12:59:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:49,014 INFO L93 Difference]: Finished difference Result 931 states and 1124 transitions. [2018-11-10 12:59:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:49,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-11-10 12:59:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:49,017 INFO L225 Difference]: With dead ends: 931 [2018-11-10 12:59:49,018 INFO L226 Difference]: Without dead ends: 638 [2018-11-10 12:59:49,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-10 12:59:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 601. [2018-11-10 12:59:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-10 12:59:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 718 transitions. [2018-11-10 12:59:49,031 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 718 transitions. Word has length 152 [2018-11-10 12:59:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:49,031 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 718 transitions. [2018-11-10 12:59:49,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 718 transitions. [2018-11-10 12:59:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 12:59:49,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:49,033 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:49,034 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:49,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash -501242974, now seen corresponding path program 1 times [2018-11-10 12:59:49,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:49,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 12:59:49,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:49,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:59:49,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:59:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:59:49,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:59:49,099 INFO L87 Difference]: Start difference. First operand 601 states and 718 transitions. Second operand 3 states. [2018-11-10 12:59:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:49,129 INFO L93 Difference]: Finished difference Result 1189 states and 1439 transitions. [2018-11-10 12:59:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:59:49,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-11-10 12:59:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:49,132 INFO L225 Difference]: With dead ends: 1189 [2018-11-10 12:59:49,133 INFO L226 Difference]: Without dead ends: 894 [2018-11-10 12:59:49,133 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 12:59:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-11-10 12:59:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-11-10 12:59:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-10 12:59:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1075 transitions. [2018-11-10 12:59:49,149 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1075 transitions. Word has length 153 [2018-11-10 12:59:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:49,151 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1075 transitions. [2018-11-10 12:59:49,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:59:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1075 transitions. [2018-11-10 12:59:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 12:59:49,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:49,153 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:49,153 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:49,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 88040089, now seen corresponding path program 1 times [2018-11-10 12:59:49,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:49,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 12:59:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:59:49,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:59:49,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:59:49,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:59:49,236 INFO L87 Difference]: Start difference. First operand 894 states and 1075 transitions. Second operand 3 states. [2018-11-10 12:59:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:49,273 INFO L93 Difference]: Finished difference Result 1189 states and 1436 transitions. [2018-11-10 12:59:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:59:49,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-10 12:59:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:49,277 INFO L225 Difference]: With dead ends: 1189 [2018-11-10 12:59:49,277 INFO L226 Difference]: Without dead ends: 1187 [2018-11-10 12:59:49,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 12:59:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-11-10 12:59:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2018-11-10 12:59:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2018-11-10 12:59:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1433 transitions. [2018-11-10 12:59:49,301 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1433 transitions. Word has length 189 [2018-11-10 12:59:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:49,301 INFO L481 AbstractCegarLoop]: Abstraction has 1187 states and 1433 transitions. [2018-11-10 12:59:49,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:59:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1433 transitions. [2018-11-10 12:59:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-10 12:59:49,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:49,306 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:49,306 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:49,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash 349785762, now seen corresponding path program 1 times [2018-11-10 12:59:49,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:49,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:49,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:49,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:59:49,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:59:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:59:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:59:49,414 INFO L87 Difference]: Start difference. First operand 1187 states and 1433 transitions. Second operand 3 states. [2018-11-10 12:59:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:49,453 INFO L93 Difference]: Finished difference Result 1189 states and 1434 transitions. [2018-11-10 12:59:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:59:49,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-11-10 12:59:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:49,455 INFO L225 Difference]: With dead ends: 1189 [2018-11-10 12:59:49,456 INFO L226 Difference]: Without dead ends: 1187 [2018-11-10 12:59:49,456 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 12:59:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-11-10 12:59:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2018-11-10 12:59:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2018-11-10 12:59:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1432 transitions. [2018-11-10 12:59:49,471 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1432 transitions. Word has length 228 [2018-11-10 12:59:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:49,472 INFO L481 AbstractCegarLoop]: Abstraction has 1187 states and 1432 transitions. [2018-11-10 12:59:49,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:59:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1432 transitions. [2018-11-10 12:59:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-10 12:59:49,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:49,474 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:49,474 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:49,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -901293864, now seen corresponding path program 1 times [2018-11-10 12:59:49,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:49,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:49,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:49,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:49,560 INFO L87 Difference]: Start difference. First operand 1187 states and 1432 transitions. Second operand 4 states. [2018-11-10 12:59:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:49,728 INFO L93 Difference]: Finished difference Result 2659 states and 3248 transitions. [2018-11-10 12:59:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:49,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-11-10 12:59:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:49,732 INFO L225 Difference]: With dead ends: 2659 [2018-11-10 12:59:49,732 INFO L226 Difference]: Without dead ends: 1537 [2018-11-10 12:59:49,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-10 12:59:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1359. [2018-11-10 12:59:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2018-11-10 12:59:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1676 transitions. [2018-11-10 12:59:49,751 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1676 transitions. Word has length 232 [2018-11-10 12:59:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:49,752 INFO L481 AbstractCegarLoop]: Abstraction has 1359 states and 1676 transitions. [2018-11-10 12:59:49,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1676 transitions. [2018-11-10 12:59:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 12:59:49,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:49,754 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:49,754 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:49,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1747814787, now seen corresponding path program 1 times [2018-11-10 12:59:49,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:49,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:49,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:49,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:49,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:59:49,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:49,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:49,862 INFO L87 Difference]: Start difference. First operand 1359 states and 1676 transitions. Second operand 6 states. [2018-11-10 12:59:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:50,256 INFO L93 Difference]: Finished difference Result 4388 states and 5432 transitions. [2018-11-10 12:59:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:50,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2018-11-10 12:59:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:50,264 INFO L225 Difference]: With dead ends: 4388 [2018-11-10 12:59:50,264 INFO L226 Difference]: Without dead ends: 3094 [2018-11-10 12:59:50,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2018-11-10 12:59:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 1375. [2018-11-10 12:59:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2018-11-10 12:59:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1692 transitions. [2018-11-10 12:59:50,294 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1692 transitions. Word has length 242 [2018-11-10 12:59:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:50,295 INFO L481 AbstractCegarLoop]: Abstraction has 1375 states and 1692 transitions. [2018-11-10 12:59:50,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:59:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1692 transitions. [2018-11-10 12:59:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 12:59:50,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:50,298 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:50,298 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:50,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:50,299 INFO L82 PathProgramCache]: Analyzing trace with hash 136964755, now seen corresponding path program 1 times [2018-11-10 12:59:50,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:50,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 12:59:50,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:50,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:50,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:50,374 INFO L87 Difference]: Start difference. First operand 1375 states and 1692 transitions. Second operand 4 states. [2018-11-10 12:59:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:50,602 INFO L93 Difference]: Finished difference Result 3369 states and 4186 transitions. [2018-11-10 12:59:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:50,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-11-10 12:59:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:50,607 INFO L225 Difference]: With dead ends: 3369 [2018-11-10 12:59:50,607 INFO L226 Difference]: Without dead ends: 2059 [2018-11-10 12:59:50,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-11-10 12:59:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1519. [2018-11-10 12:59:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2018-11-10 12:59:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1892 transitions. [2018-11-10 12:59:50,639 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1892 transitions. Word has length 260 [2018-11-10 12:59:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:50,639 INFO L481 AbstractCegarLoop]: Abstraction has 1519 states and 1892 transitions. [2018-11-10 12:59:50,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1892 transitions. [2018-11-10 12:59:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 12:59:50,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:50,643 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:50,643 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:50,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 318787123, now seen corresponding path program 1 times [2018-11-10 12:59:50,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:50,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:50,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:50,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:50,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:50,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:50,741 INFO L87 Difference]: Start difference. First operand 1519 states and 1892 transitions. Second operand 4 states. [2018-11-10 12:59:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:50,951 INFO L93 Difference]: Finished difference Result 3271 states and 4092 transitions. [2018-11-10 12:59:50,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:50,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-11-10 12:59:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:50,955 INFO L225 Difference]: With dead ends: 3271 [2018-11-10 12:59:50,955 INFO L226 Difference]: Without dead ends: 1817 [2018-11-10 12:59:50,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-11-10 12:59:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1555. [2018-11-10 12:59:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-11-10 12:59:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1932 transitions. [2018-11-10 12:59:50,984 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1932 transitions. Word has length 260 [2018-11-10 12:59:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:50,984 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 1932 transitions. [2018-11-10 12:59:50,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1932 transitions. [2018-11-10 12:59:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-10 12:59:50,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:50,987 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:50,988 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:50,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1497937170, now seen corresponding path program 1 times [2018-11-10 12:59:50,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:51,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:51,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:51,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:51,074 INFO L87 Difference]: Start difference. First operand 1555 states and 1932 transitions. Second operand 4 states. [2018-11-10 12:59:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:51,248 INFO L93 Difference]: Finished difference Result 3307 states and 4128 transitions. [2018-11-10 12:59:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:51,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-11-10 12:59:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:51,252 INFO L225 Difference]: With dead ends: 3307 [2018-11-10 12:59:51,252 INFO L226 Difference]: Without dead ends: 1817 [2018-11-10 12:59:51,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-11-10 12:59:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1563. [2018-11-10 12:59:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2018-11-10 12:59:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1940 transitions. [2018-11-10 12:59:51,279 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1940 transitions. Word has length 262 [2018-11-10 12:59:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:51,280 INFO L481 AbstractCegarLoop]: Abstraction has 1563 states and 1940 transitions. [2018-11-10 12:59:51,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1940 transitions. [2018-11-10 12:59:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 12:59:51,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:51,283 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:51,283 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 159720361, now seen corresponding path program 1 times [2018-11-10 12:59:51,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:51,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 249 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 12:59:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:59:51,406 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/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 12:59:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:51,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:51,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:59:51,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:59:51,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:59:51,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 12:59:51,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:51,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:51,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 12:59:51,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 12:59:51,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-10 12:59:51,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:51,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:51,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 12:59:51,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:51,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-11-10 12:59:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:51,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:59:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 12:59:51,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:59:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:59:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:59:51,689 INFO L87 Difference]: Start difference. First operand 1563 states and 1940 transitions. Second operand 8 states. [2018-11-10 12:59:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:52,483 INFO L93 Difference]: Finished difference Result 4811 states and 6004 transitions. [2018-11-10 12:59:52,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:59:52,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2018-11-10 12:59:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:52,490 INFO L225 Difference]: With dead ends: 4811 [2018-11-10 12:59:52,490 INFO L226 Difference]: Without dead ends: 3313 [2018-11-10 12:59:52,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:59:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2018-11-10 12:59:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2755. [2018-11-10 12:59:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-11-10 12:59:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3462 transitions. [2018-11-10 12:59:52,550 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3462 transitions. Word has length 263 [2018-11-10 12:59:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:52,551 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 3462 transitions. [2018-11-10 12:59:52,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:59:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3462 transitions. [2018-11-10 12:59:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 12:59:52,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:52,556 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:52,556 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:52,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash -733521931, now seen corresponding path program 1 times [2018-11-10 12:59:52,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:52,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:52,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:52,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:52,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:52,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:52,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:52,643 INFO L87 Difference]: Start difference. First operand 2755 states and 3462 transitions. Second operand 4 states. [2018-11-10 12:59:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:52,881 INFO L93 Difference]: Finished difference Result 5797 states and 7289 transitions. [2018-11-10 12:59:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:52,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-11-10 12:59:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:52,907 INFO L225 Difference]: With dead ends: 5797 [2018-11-10 12:59:52,907 INFO L226 Difference]: Without dead ends: 3107 [2018-11-10 12:59:52,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2018-11-10 12:59:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2755. [2018-11-10 12:59:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-11-10 12:59:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3454 transitions. [2018-11-10 12:59:53,012 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3454 transitions. Word has length 264 [2018-11-10 12:59:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:53,012 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 3454 transitions. [2018-11-10 12:59:53,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3454 transitions. [2018-11-10 12:59:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 12:59:53,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:53,017 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:53,017 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:53,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1418032087, now seen corresponding path program 1 times [2018-11-10 12:59:53,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:53,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:53,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:53,111 INFO L87 Difference]: Start difference. First operand 2755 states and 3454 transitions. Second operand 4 states. [2018-11-10 12:59:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:53,350 INFO L93 Difference]: Finished difference Result 5797 states and 7273 transitions. [2018-11-10 12:59:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:53,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-11-10 12:59:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:53,356 INFO L225 Difference]: With dead ends: 5797 [2018-11-10 12:59:53,356 INFO L226 Difference]: Without dead ends: 3107 [2018-11-10 12:59:53,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2018-11-10 12:59:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2755. [2018-11-10 12:59:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-11-10 12:59:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3446 transitions. [2018-11-10 12:59:53,412 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3446 transitions. Word has length 264 [2018-11-10 12:59:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:53,413 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 3446 transitions. [2018-11-10 12:59:53,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3446 transitions. [2018-11-10 12:59:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 12:59:53,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:53,417 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:53,417 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:53,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash -462508562, now seen corresponding path program 1 times [2018-11-10 12:59:53,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:53,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:53,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:53,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:53,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:53,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:53,504 INFO L87 Difference]: Start difference. First operand 2755 states and 3446 transitions. Second operand 4 states. [2018-11-10 12:59:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:53,702 INFO L93 Difference]: Finished difference Result 5749 states and 7199 transitions. [2018-11-10 12:59:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:53,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-11-10 12:59:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:53,711 INFO L225 Difference]: With dead ends: 5749 [2018-11-10 12:59:53,711 INFO L226 Difference]: Without dead ends: 3059 [2018-11-10 12:59:53,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-11-10 12:59:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2771. [2018-11-10 12:59:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2018-11-10 12:59:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3462 transitions. [2018-11-10 12:59:53,762 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3462 transitions. Word has length 265 [2018-11-10 12:59:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:53,763 INFO L481 AbstractCegarLoop]: Abstraction has 2771 states and 3462 transitions. [2018-11-10 12:59:53,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3462 transitions. [2018-11-10 12:59:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 12:59:53,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:53,767 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:53,767 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:53,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:53,768 INFO L82 PathProgramCache]: Analyzing trace with hash 256569828, now seen corresponding path program 1 times [2018-11-10 12:59:53,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:53,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:53,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:53,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:53,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:53,865 INFO L87 Difference]: Start difference. First operand 2771 states and 3462 transitions. Second operand 4 states. [2018-11-10 12:59:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:54,051 INFO L93 Difference]: Finished difference Result 5713 states and 7147 transitions. [2018-11-10 12:59:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:54,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-11-10 12:59:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:54,057 INFO L225 Difference]: With dead ends: 5713 [2018-11-10 12:59:54,058 INFO L226 Difference]: Without dead ends: 3007 [2018-11-10 12:59:54,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2018-11-10 12:59:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2771. [2018-11-10 12:59:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2018-11-10 12:59:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3454 transitions. [2018-11-10 12:59:54,108 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3454 transitions. Word has length 266 [2018-11-10 12:59:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:54,109 INFO L481 AbstractCegarLoop]: Abstraction has 2771 states and 3454 transitions. [2018-11-10 12:59:54,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3454 transitions. [2018-11-10 12:59:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 12:59:54,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:54,112 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:54,112 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:54,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2029647367, now seen corresponding path program 1 times [2018-11-10 12:59:54,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:54,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:54,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:54,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:54,188 INFO L87 Difference]: Start difference. First operand 2771 states and 3454 transitions. Second operand 4 states. [2018-11-10 12:59:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:54,369 INFO L93 Difference]: Finished difference Result 5713 states and 7131 transitions. [2018-11-10 12:59:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-11-10 12:59:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:54,374 INFO L225 Difference]: With dead ends: 5713 [2018-11-10 12:59:54,374 INFO L226 Difference]: Without dead ends: 3007 [2018-11-10 12:59:54,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2018-11-10 12:59:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2787. [2018-11-10 12:59:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2787 states. [2018-11-10 12:59:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3470 transitions. [2018-11-10 12:59:54,421 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3470 transitions. Word has length 266 [2018-11-10 12:59:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:54,422 INFO L481 AbstractCegarLoop]: Abstraction has 2787 states and 3470 transitions. [2018-11-10 12:59:54,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3470 transitions. [2018-11-10 12:59:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-10 12:59:54,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:54,425 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:54,425 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:54,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1945417612, now seen corresponding path program 1 times [2018-11-10 12:59:54,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:54,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:54,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:59:54,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:59:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:59:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:59:54,504 INFO L87 Difference]: Start difference. First operand 2787 states and 3470 transitions. Second operand 4 states. [2018-11-10 12:59:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:54,680 INFO L93 Difference]: Finished difference Result 5673 states and 7069 transitions. [2018-11-10 12:59:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:59:54,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-11-10 12:59:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:54,684 INFO L225 Difference]: With dead ends: 5673 [2018-11-10 12:59:54,684 INFO L226 Difference]: Without dead ends: 2951 [2018-11-10 12:59:54,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 12:59:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-11-10 12:59:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2803. [2018-11-10 12:59:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2018-11-10 12:59:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3486 transitions. [2018-11-10 12:59:54,733 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3486 transitions. Word has length 268 [2018-11-10 12:59:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:54,734 INFO L481 AbstractCegarLoop]: Abstraction has 2803 states and 3486 transitions. [2018-11-10 12:59:54,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:59:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3486 transitions. [2018-11-10 12:59:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-10 12:59:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:54,737 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:54,738 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1946408360, now seen corresponding path program 1 times [2018-11-10 12:59:54,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:54,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:54,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:59:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:54,870 INFO L87 Difference]: Start difference. First operand 2803 states and 3486 transitions. Second operand 6 states. [2018-11-10 12:59:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:55,298 INFO L93 Difference]: Finished difference Result 8317 states and 10304 transitions. [2018-11-10 12:59:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:55,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 270 [2018-11-10 12:59:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:55,305 INFO L225 Difference]: With dead ends: 8317 [2018-11-10 12:59:55,305 INFO L226 Difference]: Without dead ends: 5579 [2018-11-10 12:59:55,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:59:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2018-11-10 12:59:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 2803. [2018-11-10 12:59:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2018-11-10 12:59:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3478 transitions. [2018-11-10 12:59:55,370 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3478 transitions. Word has length 270 [2018-11-10 12:59:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:55,371 INFO L481 AbstractCegarLoop]: Abstraction has 2803 states and 3478 transitions. [2018-11-10 12:59:55,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:59:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3478 transitions. [2018-11-10 12:59:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-10 12:59:55,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:55,374 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:55,375 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:55,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -802377261, now seen corresponding path program 1 times [2018-11-10 12:59:55,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:55,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:55,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:55,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:59:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:55,474 INFO L87 Difference]: Start difference. First operand 2803 states and 3478 transitions. Second operand 6 states. [2018-11-10 12:59:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:55,976 INFO L93 Difference]: Finished difference Result 8317 states and 10288 transitions. [2018-11-10 12:59:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:55,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2018-11-10 12:59:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:55,983 INFO L225 Difference]: With dead ends: 8317 [2018-11-10 12:59:55,983 INFO L226 Difference]: Without dead ends: 5579 [2018-11-10 12:59:55,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:59:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2018-11-10 12:59:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 2803. [2018-11-10 12:59:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2018-11-10 12:59:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3470 transitions. [2018-11-10 12:59:56,043 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3470 transitions. Word has length 272 [2018-11-10 12:59:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:56,044 INFO L481 AbstractCegarLoop]: Abstraction has 2803 states and 3470 transitions. [2018-11-10 12:59:56,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:59:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3470 transitions. [2018-11-10 12:59:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-10 12:59:56,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:56,048 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:56,048 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:56,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 184912324, now seen corresponding path program 1 times [2018-11-10 12:59:56,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 12:59:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:56,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:59:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:56,158 INFO L87 Difference]: Start difference. First operand 2803 states and 3470 transitions. Second operand 6 states. [2018-11-10 12:59:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:56,705 INFO L93 Difference]: Finished difference Result 8317 states and 10272 transitions. [2018-11-10 12:59:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:56,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2018-11-10 12:59:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:56,712 INFO L225 Difference]: With dead ends: 8317 [2018-11-10 12:59:56,712 INFO L226 Difference]: Without dead ends: 5579 [2018-11-10 12:59:56,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:59:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2018-11-10 12:59:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 2803. [2018-11-10 12:59:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2018-11-10 12:59:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3462 transitions. [2018-11-10 12:59:56,774 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3462 transitions. Word has length 273 [2018-11-10 12:59:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:56,775 INFO L481 AbstractCegarLoop]: Abstraction has 2803 states and 3462 transitions. [2018-11-10 12:59:56,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:59:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3462 transitions. [2018-11-10 12:59:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-10 12:59:56,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:56,778 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:56,779 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:56,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash 36744748, now seen corresponding path program 1 times [2018-11-10 12:59:56,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 12:59:56,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:56,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:59:56,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:59:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:59:56,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:59:56,926 INFO L87 Difference]: Start difference. First operand 2803 states and 3462 transitions. Second operand 7 states. [2018-11-10 12:59:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:57,619 INFO L93 Difference]: Finished difference Result 5597 states and 6938 transitions. [2018-11-10 12:59:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:59:57,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-11-10 12:59:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:57,623 INFO L225 Difference]: With dead ends: 5597 [2018-11-10 12:59:57,623 INFO L226 Difference]: Without dead ends: 3462 [2018-11-10 12:59:57,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-11-10 12:59:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 2819. [2018-11-10 12:59:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-11-10 12:59:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3483 transitions. [2018-11-10 12:59:57,672 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3483 transitions. Word has length 273 [2018-11-10 12:59:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:57,672 INFO L481 AbstractCegarLoop]: Abstraction has 2819 states and 3483 transitions. [2018-11-10 12:59:57,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:59:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3483 transitions. [2018-11-10 12:59:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-10 12:59:57,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:57,676 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:57,676 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:57,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1236265241, now seen corresponding path program 1 times [2018-11-10 12:59:57,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:57,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:57,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:57,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 12:59:57,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:57,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:59:57,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:59:57,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:59:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:59:57,801 INFO L87 Difference]: Start difference. First operand 2819 states and 3483 transitions. Second operand 7 states. [2018-11-10 12:59:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:58,415 INFO L93 Difference]: Finished difference Result 5529 states and 6853 transitions. [2018-11-10 12:59:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:59:58,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 275 [2018-11-10 12:59:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:58,419 INFO L225 Difference]: With dead ends: 5529 [2018-11-10 12:59:58,419 INFO L226 Difference]: Without dead ends: 3394 [2018-11-10 12:59:58,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2018-11-10 12:59:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2821. [2018-11-10 12:59:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2018-11-10 12:59:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3485 transitions. [2018-11-10 12:59:58,467 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3485 transitions. Word has length 275 [2018-11-10 12:59:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:58,467 INFO L481 AbstractCegarLoop]: Abstraction has 2821 states and 3485 transitions. [2018-11-10 12:59:58,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:59:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3485 transitions. [2018-11-10 12:59:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-10 12:59:58,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:58,471 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:58,471 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:58,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1203638503, now seen corresponding path program 1 times [2018-11-10 12:59:58,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:58,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-10 12:59:58,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:58,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:59:58,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:59:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:59:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:59:58,602 INFO L87 Difference]: Start difference. First operand 2821 states and 3485 transitions. Second operand 7 states. [2018-11-10 12:59:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:59,171 INFO L93 Difference]: Finished difference Result 6132 states and 7592 transitions. [2018-11-10 12:59:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:59:59,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 301 [2018-11-10 12:59:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:59,176 INFO L225 Difference]: With dead ends: 6132 [2018-11-10 12:59:59,176 INFO L226 Difference]: Without dead ends: 3394 [2018-11-10 12:59:59,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2018-11-10 12:59:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2821. [2018-11-10 12:59:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2018-11-10 12:59:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3484 transitions. [2018-11-10 12:59:59,256 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3484 transitions. Word has length 301 [2018-11-10 12:59:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:59:59,256 INFO L481 AbstractCegarLoop]: Abstraction has 2821 states and 3484 transitions. [2018-11-10 12:59:59,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:59:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3484 transitions. [2018-11-10 12:59:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 12:59:59,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:59:59,261 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:59,261 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:59:59,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 990455330, now seen corresponding path program 1 times [2018-11-10 12:59:59,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:59,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-10 12:59:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:59:59,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:59:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:59:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:59:59,461 INFO L87 Difference]: Start difference. First operand 2821 states and 3484 transitions. Second operand 7 states. [2018-11-10 12:59:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:59,993 INFO L93 Difference]: Finished difference Result 6132 states and 7591 transitions. [2018-11-10 12:59:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:59:59,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 303 [2018-11-10 12:59:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:59:59,997 INFO L225 Difference]: With dead ends: 6132 [2018-11-10 12:59:59,997 INFO L226 Difference]: Without dead ends: 3394 [2018-11-10 12:59:59,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2018-11-10 13:00:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2821. [2018-11-10 13:00:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2018-11-10 13:00:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3483 transitions. [2018-11-10 13:00:00,045 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3483 transitions. Word has length 303 [2018-11-10 13:00:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:00,046 INFO L481 AbstractCegarLoop]: Abstraction has 2821 states and 3483 transitions. [2018-11-10 13:00:00,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:00:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3483 transitions. [2018-11-10 13:00:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 13:00:00,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:00,049 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:00,049 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:00,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1788116431, now seen corresponding path program 1 times [2018-11-10 13:00:00,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:00,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 13:00:00,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:00,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:00:00,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:00:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:00:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:00:00,124 INFO L87 Difference]: Start difference. First operand 2821 states and 3483 transitions. Second operand 4 states. [2018-11-10 13:00:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:00,400 INFO L93 Difference]: Finished difference Result 5496 states and 6803 transitions. [2018-11-10 13:00:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:00:00,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-11-10 13:00:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:00,404 INFO L225 Difference]: With dead ends: 5496 [2018-11-10 13:00:00,405 INFO L226 Difference]: Without dead ends: 3361 [2018-11-10 13:00:00,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 13:00:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2018-11-10 13:00:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 2821. [2018-11-10 13:00:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2018-11-10 13:00:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3479 transitions. [2018-11-10 13:00:00,485 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3479 transitions. Word has length 304 [2018-11-10 13:00:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:00,485 INFO L481 AbstractCegarLoop]: Abstraction has 2821 states and 3479 transitions. [2018-11-10 13:00:00,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:00:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3479 transitions. [2018-11-10 13:00:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 13:00:00,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:00,489 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:00,489 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1112027793, now seen corresponding path program 1 times [2018-11-10 13:00:00,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 13:00:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:00,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:00:00,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:00:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:00:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:00:00,591 INFO L87 Difference]: Start difference. First operand 2821 states and 3479 transitions. Second operand 4 states. [2018-11-10 13:00:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:00,832 INFO L93 Difference]: Finished difference Result 5632 states and 6988 transitions. [2018-11-10 13:00:00,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:00:00,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-11-10 13:00:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:00,835 INFO L225 Difference]: With dead ends: 5632 [2018-11-10 13:00:00,835 INFO L226 Difference]: Without dead ends: 3497 [2018-11-10 13:00:00,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 13:00:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2018-11-10 13:00:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2929. [2018-11-10 13:00:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-11-10 13:00:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3627 transitions. [2018-11-10 13:00:00,886 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3627 transitions. Word has length 304 [2018-11-10 13:00:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:00,886 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 3627 transitions. [2018-11-10 13:00:00,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:00:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3627 transitions. [2018-11-10 13:00:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-10 13:00:00,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:00,890 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:00,890 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:00,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 103654313, now seen corresponding path program 1 times [2018-11-10 13:00:00,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:01,136 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:00:01,176 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:00:01,177 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:00:01,177 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:00:01,177 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:00:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:00:01 BoogieIcfgContainer [2018-11-10 13:00:01,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:00:01,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:00:01,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:00:01,226 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:00:01,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:47" (3/4) ... [2018-11-10 13:00:01,229 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:00:01,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:00:01,230 INFO L168 Benchmark]: Toolchain (without parser) took 15897.30 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 723.5 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -74.5 MB). Peak memory consumption was 649.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:01,231 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:01,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -93.8 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:01,232 INFO L168 Benchmark]: Boogie Preprocessor took 74.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:01,232 INFO L168 Benchmark]: RCFGBuilder took 867.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 947.0 MB in the end (delta: 95.4 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:01,232 INFO L168 Benchmark]: TraceAbstraction took 14208.58 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.1 MB). Free memory was 943.9 MB in the beginning and 1.0 GB in the end (delta: -88.7 MB). Peak memory consumption was 495.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:01,233 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:01,236 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -93.8 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 867.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 947.0 MB in the end (delta: 95.4 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14208.58 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.1 MB). Free memory was 943.9 MB in the beginning and 1.0 GB in the end (delta: -88.7 MB). Peak memory consumption was 495.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; VAL [\old(init)=20488, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20490:20484}] [L1043] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20488, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20491:0}] [L1065] EXPR, FCALL malloc(sizeof(SSL)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, SSLv3_client_data={20491:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; VAL [init=1, malloc(sizeof(SSL))={20481:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1069] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1070] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(SSL_SESSION))={20483:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1071] FCALL s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(SSL_SESSION))={20483:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1072] FCALL s->state = 12292 VAL [init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(SSL_SESSION))={20483:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1073] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, init=1, malloc(sizeof(SSL))={20481:0}, malloc(sizeof(SSL_CTX))={20486:0}, malloc(sizeof(SSL_SESSION))={20483:0}, malloc(sizeof(struct ssl3_state_st))={20494:0}, s={20481:0}, SSLv3_client_data={20491:0}] [L1074] CALL ssl3_connect(s) VAL [init=1, s={20481:0}, SSLv3_client_data={20491:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] FCALL s->hit=__VERIFIER_nondet_int () VAL [__VERIFIER_nondet_int ()=0, blastFlag=0, buf={20495:20489}, init=1, s={20481:0}, s={20481:0}, SSLv3_client_data={20491:0}, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1105] FCALL s->state = 12292 VAL [blastFlag=0, buf={20495:20489}, init=1, s={20481:0}, s={20481:0}, SSLv3_client_data={20491:0}, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 VAL [={0:0}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1110] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->info_callback={6:5}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->info_callback={6:5}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1112] cb = s->info_callback [L1120] EXPR, FCALL s->in_handshake VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1120] FCALL s->in_handshake += 1 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1121] COND FALSE !(tmp___1 & 12288) VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=12292, skip=0, SSLv3_client_data={20491:0}, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=12292, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] FCALL s->new_session = 1 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1238] FCALL s->state = 4096 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1239] EXPR, FCALL s->ctx VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1239] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={6:5}, (s->ctx)->stats.sess_connect_renegotiate=1, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1239] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={6:5}, (s->ctx)->stats.sess_connect_renegotiate=1, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1244] FCALL s->server = 0 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1250] EXPR, FCALL s->version VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->version=1, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] FCALL s->type = 4096 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1257] EXPR, FCALL s->init_buf VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->init_buf={-2:3}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] FCALL s->state = 4368 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] EXPR, FCALL s->ctx VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [={6:5}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] FCALL (s->ctx)->stats.sess_connect += 1 VAL [={6:5}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->ctx={20486:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1285] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] FCALL s->shutdown = 0 VAL [={6:5}, blastFlag=0, buf={20495:20489}, init=1, ret=-1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1301] FCALL s->state = 4384 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] EXPR, FCALL s->bbio VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->bbio={1:2}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] EXPR, FCALL s->wbio VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->bbio={1:2}, s->wbio={1:1}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={6:5}, blastFlag=1, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] FCALL s->hit VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->hit=0, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] FCALL s->state = 4400 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [={6:5}, (s->s3)->tmp.new_cipher={20487:1}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:5}, ((s->s3)->tmp.new_cipher)->algorithms=20496, (s->s3)->tmp.new_cipher={20487:1}, blastFlag=2, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->state = 4416 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1347] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={6:5}, blastFlag=3, buf={20495:20489}, init=1, ret=10, s={20481:0}, s={20481:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] FCALL s->state = 4432 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1363] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1385] FCALL s->state = 4448 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1386] FCALL s->init_num = 0 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={6:5}, (s->s3)->tmp.reuse_message=20497, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->s3={20494:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR, FCALL s->state VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=1, s={20481:0}, s={20481:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=0, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1646] __VERIFIER_error() VAL [={6:5}, blastFlag=4, buf={20495:20489}, init=1, ret=0, s={20481:0}, s={20481:0}, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=1, tmp___0={20492:20493}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 384 locations, 1 error locations. UNSAFE Result, 14.1s OverallTime, 30 OverallIterations, 7 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13409 SDtfs, 7515 SDslu, 29018 SDs, 0 SdLazy, 11771 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 366 SyntacticMatches, 55 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2929occurred in iteration=29, 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.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 17366 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 7474 NumberOfCodeBlocks, 7474 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 3578841 SizeOfPredicates, 3 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 7950/7951 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:00:02,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:00:02,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:00:02,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:00:02,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:00:02,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:00:02,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:00:02,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:00:02,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:00:02,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:00:02,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:00:02,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:00:02,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:00:02,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:00:02,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:00:02,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:00:02,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:00:02,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:00:02,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:00:02,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:00:02,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:00:02,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:00:02,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:00:02,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:00:02,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:00:02,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:00:02,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:00:02,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:00:02,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:00:02,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:00:02,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:00:02,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:00:02,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:00:02,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:00:02,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:00:02,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:00:02,739 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 13:00:02,750 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:00:02,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:00:02,751 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:00:02,751 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:00:02,751 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:00:02,752 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:00:02,752 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:00:02,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:00:02,752 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:00:02,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:00:02,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:00:02,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:00:02,754 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:00:02,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:00:02,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:00:02,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:00:02,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:00:02,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:00:02,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:00:02,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:00:02,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:00:02,756 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 13:00:02,757 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:00:02,757 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 13:00:02,757 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 13:00:02,757 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_217008cf-cefe-46bc-a515-cf1035f3428d/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 -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-11-10 13:00:02,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:00:02,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:00:02,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:00:02,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:00:02,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:00:02,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 13:00:02,854 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/d0987da68/4f87d5193f1e40e48dcf53fb50c1baa0/FLAGf8b9621a1 [2018-11-10 13:00:03,239 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:00:03,240 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 13:00:03,251 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/d0987da68/4f87d5193f1e40e48dcf53fb50c1baa0/FLAGf8b9621a1 [2018-11-10 13:00:03,261 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/data/d0987da68/4f87d5193f1e40e48dcf53fb50c1baa0 [2018-11-10 13:00:03,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:00:03,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 13:00:03,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:03,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:00:03,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:00:03,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:03" (1/1) ... [2018-11-10 13:00:03,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d9a4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:03, skipping insertion in model container [2018-11-10 13:00:03,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:03" (1/1) ... [2018-11-10 13:00:03,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:00:03,327 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:00:03,908 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:03,920 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:00:04,182 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:04,198 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:00:04,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04 WrapperNode [2018-11-10 13:00:04,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:04,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:00:04,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:00:04,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:00:04,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... [2018-11-10 13:00:04,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:00:04,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:00:04,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:00:04,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:00:04,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/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 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-10 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-10 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:00:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 13:00:04,393 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-10 13:00:04,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 13:00:04,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 13:00:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 13:00:04,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:00:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 13:00:04,759 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 13:00:04,759 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 13:00:05,515 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:00:05,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:05 BoogieIcfgContainer [2018-11-10 13:00:05,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:00:05,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:00:05,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:00:05,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:00:05,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:00:03" (1/3) ... [2018-11-10 13:00:05,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf42986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:05, skipping insertion in model container [2018-11-10 13:00:05,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:04" (2/3) ... [2018-11-10 13:00:05,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf42986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:05, skipping insertion in model container [2018-11-10 13:00:05,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:05" (3/3) ... [2018-11-10 13:00:05,523 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 13:00:05,532 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:00:05,539 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:00:05,553 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:00:05,582 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:00:05,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:00:05,582 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:00:05,583 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:00:05,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:00:05,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:00:05,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:00:05,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:00:05,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:00:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2018-11-10 13:00:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:00:05,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:05,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:05,619 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:05,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2124448, now seen corresponding path program 1 times [2018-11-10 13:00:05,630 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:05,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:05,815 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 13:00:05,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:05,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:05,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:05,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:05,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:05,836 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 3 states. [2018-11-10 13:00:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:05,926 INFO L93 Difference]: Finished difference Result 906 states and 1158 transitions. [2018-11-10 13:00:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:05,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-10 13:00:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:05,940 INFO L225 Difference]: With dead ends: 906 [2018-11-10 13:00:05,940 INFO L226 Difference]: Without dead ends: 554 [2018-11-10 13:00:05,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 13:00:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-10 13:00:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-11-10 13:00:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-11-10 13:00:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 658 transitions. [2018-11-10 13:00:05,994 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 658 transitions. Word has length 92 [2018-11-10 13:00:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:05,995 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 658 transitions. [2018-11-10 13:00:05,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 658 transitions. [2018-11-10 13:00:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:00:05,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:05,998 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:05,999 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:05,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 818560904, now seen corresponding path program 1 times [2018-11-10 13:00:06,000 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:06,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:06,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:06,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:06,128 INFO L87 Difference]: Start difference. First operand 554 states and 658 transitions. Second operand 3 states. [2018-11-10 13:00:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:06,211 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2018-11-10 13:00:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:06,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-10 13:00:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:06,215 INFO L225 Difference]: With dead ends: 1044 [2018-11-10 13:00:06,215 INFO L226 Difference]: Without dead ends: 795 [2018-11-10 13:00:06,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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 13:00:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-11-10 13:00:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2018-11-10 13:00:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-11-10 13:00:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 946 transitions. [2018-11-10 13:00:06,238 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 946 transitions. Word has length 121 [2018-11-10 13:00:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:06,238 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 946 transitions. [2018-11-10 13:00:06,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 946 transitions. [2018-11-10 13:00:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:00:06,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:06,243 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 13:00:06,243 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:06,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1890151626, now seen corresponding path program 1 times [2018-11-10 13:00:06,245 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:06,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:00:06,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 13:00:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:06,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:06,407 INFO L87 Difference]: Start difference. First operand 795 states and 946 transitions. Second operand 3 states. [2018-11-10 13:00:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:06,496 INFO L93 Difference]: Finished difference Result 1531 states and 1836 transitions. [2018-11-10 13:00:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:06,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-11-10 13:00:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:06,501 INFO L225 Difference]: With dead ends: 1531 [2018-11-10 13:00:06,501 INFO L226 Difference]: Without dead ends: 1041 [2018-11-10 13:00:06,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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 13:00:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-11-10 13:00:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2018-11-10 13:00:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-10 13:00:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1240 transitions. [2018-11-10 13:00:06,527 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1240 transitions. Word has length 152 [2018-11-10 13:00:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:06,528 INFO L481 AbstractCegarLoop]: Abstraction has 1041 states and 1240 transitions. [2018-11-10 13:00:06,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1240 transitions. [2018-11-10 13:00:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 13:00:06,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:06,532 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:06,532 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:06,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash 434765185, now seen corresponding path program 1 times [2018-11-10 13:00:06,533 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:06,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:06,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 13:00:06,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:06,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:06,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:06,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:06,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:06,709 INFO L87 Difference]: Start difference. First operand 1041 states and 1240 transitions. Second operand 3 states. [2018-11-10 13:00:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:06,760 INFO L93 Difference]: Finished difference Result 2019 states and 2420 transitions. [2018-11-10 13:00:06,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:06,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-10 13:00:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:06,764 INFO L225 Difference]: With dead ends: 2019 [2018-11-10 13:00:06,764 INFO L226 Difference]: Without dead ends: 1283 [2018-11-10 13:00:06,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 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 13:00:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2018-11-10 13:00:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2018-11-10 13:00:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-11-10 13:00:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1530 transitions. [2018-11-10 13:00:06,785 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1530 transitions. Word has length 188 [2018-11-10 13:00:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:06,785 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1530 transitions. [2018-11-10 13:00:06,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1530 transitions. [2018-11-10 13:00:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 13:00:06,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:06,788 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:06,788 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:06,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:06,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1403740903, now seen corresponding path program 1 times [2018-11-10 13:00:06,789 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:06,790 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:06,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:06,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:06,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:06,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:06,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:06,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:06,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:06,931 INFO L87 Difference]: Start difference. First operand 1283 states and 1530 transitions. Second operand 3 states. [2018-11-10 13:00:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:06,984 INFO L93 Difference]: Finished difference Result 2254 states and 2696 transitions. [2018-11-10 13:00:06,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:06,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-10 13:00:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:06,988 INFO L225 Difference]: With dead ends: 2254 [2018-11-10 13:00:06,988 INFO L226 Difference]: Without dead ends: 1276 [2018-11-10 13:00:06,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 225 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 13:00:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-11-10 13:00:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2018-11-10 13:00:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-11-10 13:00:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1516 transitions. [2018-11-10 13:00:07,006 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1516 transitions. Word has length 227 [2018-11-10 13:00:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:07,006 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1516 transitions. [2018-11-10 13:00:07,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1516 transitions. [2018-11-10 13:00:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 13:00:07,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:07,009 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:07,009 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2113411983, now seen corresponding path program 1 times [2018-11-10 13:00:07,010 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:07,010 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:07,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:07,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:07,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:07,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:07,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:07,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:07,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:07,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:07,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:07,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:07,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:07,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:07,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:07,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 13:00:07,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:07,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:07,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:00:07,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:00:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:00:07,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:00:07,658 INFO L87 Difference]: Start difference. First operand 1276 states and 1516 transitions. Second operand 9 states. [2018-11-10 13:00:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:09,032 INFO L93 Difference]: Finished difference Result 3169 states and 3819 transitions. [2018-11-10 13:00:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:00:09,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-11-10 13:00:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:09,039 INFO L225 Difference]: With dead ends: 3169 [2018-11-10 13:00:09,039 INFO L226 Difference]: Without dead ends: 1957 [2018-11-10 13:00:09,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:00:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2018-11-10 13:00:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1420. [2018-11-10 13:00:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-11-10 13:00:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1716 transitions. [2018-11-10 13:00:09,079 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1716 transitions. Word has length 231 [2018-11-10 13:00:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:09,080 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 1716 transitions. [2018-11-10 13:00:09,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:00:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1716 transitions. [2018-11-10 13:00:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 13:00:09,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:09,084 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:09,084 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:09,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1206529839, now seen corresponding path program 1 times [2018-11-10 13:00:09,085 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:09,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:09,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:09,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:09,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:09,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:09,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:09,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:09,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:09,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:09,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:09,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:09,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:09,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:09,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:09,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:00:09,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:00:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:00:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:00:09,728 INFO L87 Difference]: Start difference. First operand 1420 states and 1716 transitions. Second operand 9 states. [2018-11-10 13:00:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:10,873 INFO L93 Difference]: Finished difference Result 3450 states and 4211 transitions. [2018-11-10 13:00:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:00:10,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-11-10 13:00:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:10,880 INFO L225 Difference]: With dead ends: 3450 [2018-11-10 13:00:10,880 INFO L226 Difference]: Without dead ends: 2094 [2018-11-10 13:00:10,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:00:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-11-10 13:00:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1608. [2018-11-10 13:00:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2018-11-10 13:00:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1984 transitions. [2018-11-10 13:00:10,925 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1984 transitions. Word has length 231 [2018-11-10 13:00:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:10,925 INFO L481 AbstractCegarLoop]: Abstraction has 1608 states and 1984 transitions. [2018-11-10 13:00:10,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:00:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1984 transitions. [2018-11-10 13:00:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 13:00:10,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:10,930 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:10,931 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:10,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash -357816822, now seen corresponding path program 1 times [2018-11-10 13:00:10,932 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:10,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:11,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:11,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:11,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:11,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:11,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:11,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:11,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:11,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:11,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:11,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:11,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:11,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:11,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:11,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:11,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:11,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:00:11,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:00:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:00:11,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:00:11,513 INFO L87 Difference]: Start difference. First operand 1608 states and 1984 transitions. Second operand 9 states. [2018-11-10 13:00:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:12,368 INFO L93 Difference]: Finished difference Result 3610 states and 4445 transitions. [2018-11-10 13:00:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:00:12,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 233 [2018-11-10 13:00:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:12,375 INFO L225 Difference]: With dead ends: 3610 [2018-11-10 13:00:12,375 INFO L226 Difference]: Without dead ends: 2066 [2018-11-10 13:00:12,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:00:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-10 13:00:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1616. [2018-11-10 13:00:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-11-10 13:00:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1992 transitions. [2018-11-10 13:00:12,420 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1992 transitions. Word has length 233 [2018-11-10 13:00:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:12,421 INFO L481 AbstractCegarLoop]: Abstraction has 1616 states and 1992 transitions. [2018-11-10 13:00:12,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:00:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1992 transitions. [2018-11-10 13:00:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 13:00:12,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:12,425 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:12,425 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:12,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1828594828, now seen corresponding path program 1 times [2018-11-10 13:00:12,426 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:12,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:12,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 13:00:12,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 13:00:12,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:12,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:12,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 13:00:12,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 13:00:12,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:12,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:12,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 13:00:12,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 13:00:12,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:12,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-10 13:00:12,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-10 13:00:12,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 13:00:12,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:12,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-10 13:00:12,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:12,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-10 13:00:13,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:13,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:13,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 13:00:13,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:13,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:13,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-10 13:00:13,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2018-11-10 13:00:13,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2018-11-10 13:00:13,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-11-10 13:00:13,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:00:13,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-11-10 13:00:13,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:13,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-10 13:00:13,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-11-10 13:00:13,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 13:00:13,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-10 13:00:13,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 13:00:13,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-10 13:00:13,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:00:13,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2018-11-10 13:00:13,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 13:00:13,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-10 13:00:13,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:13,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:4 [2018-11-10 13:00:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 161 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 13:00:13,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 165 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 13:00:14,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:00:14,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2018-11-10 13:00:14,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:00:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:00:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:00:14,214 INFO L87 Difference]: Start difference. First operand 1616 states and 1992 transitions. Second operand 23 states. [2018-11-10 13:00:19,977 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-10 13:00:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:27,680 INFO L93 Difference]: Finished difference Result 11259 states and 14056 transitions. [2018-11-10 13:00:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 13:00:27,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 241 [2018-11-10 13:00:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:27,695 INFO L225 Difference]: With dead ends: 11259 [2018-11-10 13:00:27,695 INFO L226 Difference]: Without dead ends: 9707 [2018-11-10 13:00:27,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=439, Invalid=1723, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 13:00:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2018-11-10 13:00:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 5554. [2018-11-10 13:00:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5554 states. [2018-11-10 13:00:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 7070 transitions. [2018-11-10 13:00:27,864 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 7070 transitions. Word has length 241 [2018-11-10 13:00:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:27,865 INFO L481 AbstractCegarLoop]: Abstraction has 5554 states and 7070 transitions. [2018-11-10 13:00:27,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:00:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 7070 transitions. [2018-11-10 13:00:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 13:00:27,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:27,872 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:27,872 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:27,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1659559966, now seen corresponding path program 1 times [2018-11-10 13:00:27,873 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:27,873 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:27,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:27,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-10 13:00:28,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:28,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:28,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:28,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:28,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:28,010 INFO L87 Difference]: Start difference. First operand 5554 states and 7070 transitions. Second operand 3 states. [2018-11-10 13:00:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:28,093 INFO L93 Difference]: Finished difference Result 11166 states and 14214 transitions. [2018-11-10 13:00:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:28,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-11-10 13:00:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:28,107 INFO L225 Difference]: With dead ends: 11166 [2018-11-10 13:00:28,107 INFO L226 Difference]: Without dead ends: 5676 [2018-11-10 13:00:28,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 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 13:00:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2018-11-10 13:00:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5610. [2018-11-10 13:00:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2018-11-10 13:00:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 7110 transitions. [2018-11-10 13:00:28,252 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 7110 transitions. Word has length 244 [2018-11-10 13:00:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:28,253 INFO L481 AbstractCegarLoop]: Abstraction has 5610 states and 7110 transitions. [2018-11-10 13:00:28,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 7110 transitions. [2018-11-10 13:00:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 13:00:28,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:28,260 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:28,260 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:28,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1791376857, now seen corresponding path program 1 times [2018-11-10 13:00:28,261 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:28,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:28,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 13:00:28,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:00:28,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:28,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:28,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:00:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:28,410 INFO L87 Difference]: Start difference. First operand 5610 states and 7110 transitions. Second operand 3 states. [2018-11-10 13:00:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:28,577 INFO L93 Difference]: Finished difference Result 16555 states and 21013 transitions. [2018-11-10 13:00:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:28,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-11-10 13:00:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:28,600 INFO L225 Difference]: With dead ends: 16555 [2018-11-10 13:00:28,600 INFO L226 Difference]: Without dead ends: 11009 [2018-11-10 13:00:28,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 251 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 13:00:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2018-11-10 13:00:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11005. [2018-11-10 13:00:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11005 states. [2018-11-10 13:00:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11005 states to 11005 states and 13922 transitions. [2018-11-10 13:00:28,853 INFO L78 Accepts]: Start accepts. Automaton has 11005 states and 13922 transitions. Word has length 253 [2018-11-10 13:00:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:28,854 INFO L481 AbstractCegarLoop]: Abstraction has 11005 states and 13922 transitions. [2018-11-10 13:00:28,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:00:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11005 states and 13922 transitions. [2018-11-10 13:00:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 13:00:28,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:28,864 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:28,864 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:28,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2013133355, now seen corresponding path program 1 times [2018-11-10 13:00:28,865 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:28,865 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:28,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:29,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:00:29,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:00:29,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 13:00:29,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:00:29,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:00:29,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:00:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 13:00:29,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:29,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:00:29,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 13:00:29,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:29,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 13:00:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 13:00:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:00:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 13:00:29,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:00:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:00:29,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:00:29,249 INFO L87 Difference]: Start difference. First operand 11005 states and 13922 transitions. Second operand 13 states. [2018-11-10 13:00:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:31,150 INFO L93 Difference]: Finished difference Result 22044 states and 27584 transitions. [2018-11-10 13:00:31,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 13:00:31,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 259 [2018-11-10 13:00:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:31,168 INFO L225 Difference]: With dead ends: 22044 [2018-11-10 13:00:31,168 INFO L226 Difference]: Without dead ends: 13424 [2018-11-10 13:00:31,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:00:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13424 states. [2018-11-10 13:00:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13424 to 11491. [2018-11-10 13:00:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11491 states. [2018-11-10 13:00:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11491 states to 11491 states and 14504 transitions. [2018-11-10 13:00:31,447 INFO L78 Accepts]: Start accepts. Automaton has 11491 states and 14504 transitions. Word has length 259 [2018-11-10 13:00:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:31,447 INFO L481 AbstractCegarLoop]: Abstraction has 11491 states and 14504 transitions. [2018-11-10 13:00:31,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:00:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 11491 states and 14504 transitions. [2018-11-10 13:00:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 13:00:31,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:31,453 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:31,453 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:31,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:31,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1316208298, now seen corresponding path program 1 times [2018-11-10 13:00:31,454 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:31,454 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:31,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:31,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:31,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:31,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:31,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:31,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:31,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:32,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:32,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:32,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:32,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:32,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:32,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:32,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:32,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:32,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:32,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 152 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:32,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:32,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:32,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:32,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:32,154 INFO L87 Difference]: Start difference. First operand 11491 states and 14504 transitions. Second operand 11 states. [2018-11-10 13:00:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:33,714 INFO L93 Difference]: Finished difference Result 33166 states and 41801 transitions. [2018-11-10 13:00:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:33,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 259 [2018-11-10 13:00:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:33,740 INFO L225 Difference]: With dead ends: 33166 [2018-11-10 13:00:33,740 INFO L226 Difference]: Without dead ends: 21744 [2018-11-10 13:00:33,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21744 states. [2018-11-10 13:00:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21744 to 12443. [2018-11-10 13:00:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12443 states. [2018-11-10 13:00:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12443 states to 12443 states and 15572 transitions. [2018-11-10 13:00:34,061 INFO L78 Accepts]: Start accepts. Automaton has 12443 states and 15572 transitions. Word has length 259 [2018-11-10 13:00:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:34,061 INFO L481 AbstractCegarLoop]: Abstraction has 12443 states and 15572 transitions. [2018-11-10 13:00:34,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 12443 states and 15572 transitions. [2018-11-10 13:00:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 13:00:34,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:34,068 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:34,069 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:34,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1689181827, now seen corresponding path program 1 times [2018-11-10 13:00:34,069 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:34,069 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:34,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:34,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:34,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:34,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:34,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:34,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:34,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:34,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:34,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:34,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:34,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:34,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:34,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:34,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 201 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:34,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 13:00:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:34,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:34,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:34,758 INFO L87 Difference]: Start difference. First operand 12443 states and 15572 transitions. Second operand 11 states. [2018-11-10 13:00:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:36,441 INFO L93 Difference]: Finished difference Result 31572 states and 39565 transitions. [2018-11-10 13:00:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:36,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2018-11-10 13:00:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:36,466 INFO L225 Difference]: With dead ends: 31572 [2018-11-10 13:00:36,466 INFO L226 Difference]: Without dead ends: 21646 [2018-11-10 13:00:36,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21646 states. [2018-11-10 13:00:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21646 to 12891. [2018-11-10 13:00:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2018-11-10 13:00:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 16122 transitions. [2018-11-10 13:00:36,807 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 16122 transitions. Word has length 260 [2018-11-10 13:00:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:36,807 INFO L481 AbstractCegarLoop]: Abstraction has 12891 states and 16122 transitions. [2018-11-10 13:00:36,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 16122 transitions. [2018-11-10 13:00:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 13:00:36,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:36,814 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:36,814 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:36,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1734458288, now seen corresponding path program 1 times [2018-11-10 13:00:36,815 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:36,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:36,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:36,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:36,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:00:36,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:00:36,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:36,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:36,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:36,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 13:00:36,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:00:37,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:00:37,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:00:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 13:00:37,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:37,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:00:37,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 13:00:37,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:37,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 13:00:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 13:00:37,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:00:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 13:00:37,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:00:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:00:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:00:37,181 INFO L87 Difference]: Start difference. First operand 12891 states and 16122 transitions. Second operand 13 states. [2018-11-10 13:00:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:39,198 INFO L93 Difference]: Finished difference Result 25924 states and 32192 transitions. [2018-11-10 13:00:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:00:39,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2018-11-10 13:00:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:39,214 INFO L225 Difference]: With dead ends: 25924 [2018-11-10 13:00:39,215 INFO L226 Difference]: Without dead ends: 15664 [2018-11-10 13:00:39,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:00:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15664 states. [2018-11-10 13:00:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15664 to 13531. [2018-11-10 13:00:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13531 states. [2018-11-10 13:00:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13531 states to 13531 states and 16922 transitions. [2018-11-10 13:00:39,544 INFO L78 Accepts]: Start accepts. Automaton has 13531 states and 16922 transitions. Word has length 261 [2018-11-10 13:00:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:39,545 INFO L481 AbstractCegarLoop]: Abstraction has 13531 states and 16922 transitions. [2018-11-10 13:00:39,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:00:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13531 states and 16922 transitions. [2018-11-10 13:00:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 13:00:39,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:39,553 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:39,553 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:39,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2022305226, now seen corresponding path program 1 times [2018-11-10 13:00:39,553 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:40,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:40,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:40,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:40,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:40,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:40,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:40,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:40,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:40,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:40,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:40,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:40,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:40,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 164 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 13:00:40,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 13:00:40,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:40,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:40,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:40,201 INFO L87 Difference]: Start difference. First operand 13531 states and 16922 transitions. Second operand 11 states. [2018-11-10 13:00:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:42,046 INFO L93 Difference]: Finished difference Result 35884 states and 44829 transitions. [2018-11-10 13:00:42,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:42,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-11-10 13:00:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:42,064 INFO L225 Difference]: With dead ends: 35884 [2018-11-10 13:00:42,065 INFO L226 Difference]: Without dead ends: 22422 [2018-11-10 13:00:42,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 518 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-11-10 13:00:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 13531. [2018-11-10 13:00:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13531 states. [2018-11-10 13:00:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13531 states to 13531 states and 16792 transitions. [2018-11-10 13:00:42,397 INFO L78 Accepts]: Start accepts. Automaton has 13531 states and 16792 transitions. Word has length 263 [2018-11-10 13:00:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:42,398 INFO L481 AbstractCegarLoop]: Abstraction has 13531 states and 16792 transitions. [2018-11-10 13:00:42,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13531 states and 16792 transitions. [2018-11-10 13:00:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 13:00:42,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:42,404 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:42,404 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:42,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 537130595, now seen corresponding path program 1 times [2018-11-10 13:00:42,405 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:42,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:42,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:42,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:42,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:42,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:42,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:42,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:42,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:42,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:42,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:42,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:42,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:42,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:42,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 213 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 13:00:42,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 13:00:43,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:43,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:43,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:43,073 INFO L87 Difference]: Start difference. First operand 13531 states and 16792 transitions. Second operand 11 states. [2018-11-10 13:00:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:44,840 INFO L93 Difference]: Finished difference Result 33094 states and 41155 transitions. [2018-11-10 13:00:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:44,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 264 [2018-11-10 13:00:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:44,856 INFO L225 Difference]: With dead ends: 33094 [2018-11-10 13:00:44,856 INFO L226 Difference]: Without dead ends: 22144 [2018-11-10 13:00:44,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22144 states. [2018-11-10 13:00:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22144 to 13615. [2018-11-10 13:00:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13615 states. [2018-11-10 13:00:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 16804 transitions. [2018-11-10 13:00:45,254 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 16804 transitions. Word has length 264 [2018-11-10 13:00:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:45,255 INFO L481 AbstractCegarLoop]: Abstraction has 13615 states and 16804 transitions. [2018-11-10 13:00:45,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 16804 transitions. [2018-11-10 13:00:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-10 13:00:45,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:45,261 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:45,261 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:45,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:45,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1537450926, now seen corresponding path program 1 times [2018-11-10 13:00:45,262 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:45,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:45,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:45,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:45,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:45,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:45,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-10 13:00:45,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-10 13:00:45,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 13:00:45,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-10 13:00:45,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 72 [2018-11-10 13:00:45,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2018-11-10 13:00:45,857 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:00:45,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-10 13:00:45,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-10 13:00:45,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2018-11-10 13:00:45,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-10 13:00:45,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 72 [2018-11-10 13:00:45,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2018-11-10 13:00:45,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:00:45,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-10 13:00:45,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-10 13:00:45,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2018-11-10 13:00:45,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-10 13:00:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:45,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2018-11-10 13:00:45,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:45,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-11-10 13:00:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 289 proven. 77 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:00:46,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 289 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-10 13:00:46,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:00:46,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2018-11-10 13:00:46,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:00:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:00:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:00:46,231 INFO L87 Difference]: Start difference. First operand 13615 states and 16804 transitions. Second operand 15 states. [2018-11-10 13:00:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:50,211 INFO L93 Difference]: Finished difference Result 51143 states and 63338 transitions. [2018-11-10 13:00:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:00:50,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 294 [2018-11-10 13:00:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:50,236 INFO L225 Difference]: With dead ends: 51143 [2018-11-10 13:00:50,236 INFO L226 Difference]: Without dead ends: 37597 [2018-11-10 13:00:50,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 573 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:00:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37597 states. [2018-11-10 13:00:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37597 to 23835. [2018-11-10 13:00:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23835 states. [2018-11-10 13:00:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23835 states to 23835 states and 29682 transitions. [2018-11-10 13:00:50,894 INFO L78 Accepts]: Start accepts. Automaton has 23835 states and 29682 transitions. Word has length 294 [2018-11-10 13:00:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:50,894 INFO L481 AbstractCegarLoop]: Abstraction has 23835 states and 29682 transitions. [2018-11-10 13:00:50,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:00:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23835 states and 29682 transitions. [2018-11-10 13:00:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-10 13:00:50,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:50,905 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:50,905 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:50,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1475122190, now seen corresponding path program 1 times [2018-11-10 13:00:50,906 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:50,906 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:50,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:51,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:51,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:51,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:51,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:51,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:51,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:51,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:51,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:51,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:51,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:51,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 236 proven. 3 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:51,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:51,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:51,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:51,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:51,617 INFO L87 Difference]: Start difference. First operand 23835 states and 29682 transitions. Second operand 11 states. [2018-11-10 13:00:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:53,859 INFO L93 Difference]: Finished difference Result 64503 states and 80432 transitions. [2018-11-10 13:00:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:53,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2018-11-10 13:00:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:53,884 INFO L225 Difference]: With dead ends: 64503 [2018-11-10 13:00:53,885 INFO L226 Difference]: Without dead ends: 40737 [2018-11-10 13:00:53,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 580 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40737 states. [2018-11-10 13:00:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40737 to 25123. [2018-11-10 13:00:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25123 states. [2018-11-10 13:00:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25123 states to 25123 states and 31050 transitions. [2018-11-10 13:00:54,540 INFO L78 Accepts]: Start accepts. Automaton has 25123 states and 31050 transitions. Word has length 294 [2018-11-10 13:00:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:54,540 INFO L481 AbstractCegarLoop]: Abstraction has 25123 states and 31050 transitions. [2018-11-10 13:00:54,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 25123 states and 31050 transitions. [2018-11-10 13:00:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-10 13:00:54,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:54,553 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:54,553 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:54,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash -973547377, now seen corresponding path program 1 times [2018-11-10 13:00:54,554 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:54,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:55,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:55,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:55,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:55,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:55,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:55,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:55,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:55,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:55,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:55,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:55,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:55,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:55,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:55,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:55,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:55,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:55,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:55,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:55,424 INFO L87 Difference]: Start difference. First operand 25123 states and 31050 transitions. Second operand 11 states. [2018-11-10 13:00:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:57,791 INFO L93 Difference]: Finished difference Result 68199 states and 84628 transitions. [2018-11-10 13:00:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:00:57,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 295 [2018-11-10 13:00:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:00:57,903 INFO L225 Difference]: With dead ends: 68199 [2018-11-10 13:00:57,903 INFO L226 Difference]: Without dead ends: 43145 [2018-11-10 13:00:57,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 582 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:00:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43145 states. [2018-11-10 13:00:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43145 to 26043. [2018-11-10 13:00:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2018-11-10 13:00:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 31870 transitions. [2018-11-10 13:00:58,597 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 31870 transitions. Word has length 295 [2018-11-10 13:00:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:00:58,597 INFO L481 AbstractCegarLoop]: Abstraction has 26043 states and 31870 transitions. [2018-11-10 13:00:58,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:00:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 31870 transitions. [2018-11-10 13:00:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-10 13:00:58,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:00:58,609 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:58,609 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:00:58,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1658057533, now seen corresponding path program 1 times [2018-11-10 13:00:58,610 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:00:58,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:00:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:59,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:59,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:00:59,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:00:59,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:00:59,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:00:59,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:59,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:59,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:00:59,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:00:59,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:00:59,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:59,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:00:59,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:59,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:00:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 208 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:59,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:00:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:00:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:00:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:00:59,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:00:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:00:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:00:59,426 INFO L87 Difference]: Start difference. First operand 26043 states and 31870 transitions. Second operand 11 states. [2018-11-10 13:01:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:01,762 INFO L93 Difference]: Finished difference Result 67903 states and 83596 transitions. [2018-11-10 13:01:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:01:01,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 295 [2018-11-10 13:01:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:01,792 INFO L225 Difference]: With dead ends: 67903 [2018-11-10 13:01:01,792 INFO L226 Difference]: Without dead ends: 41929 [2018-11-10 13:01:01,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 582 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:01:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41929 states. [2018-11-10 13:01:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41929 to 26043. [2018-11-10 13:01:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2018-11-10 13:01:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 31610 transitions. [2018-11-10 13:01:02,528 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 31610 transitions. Word has length 295 [2018-11-10 13:01:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:02,529 INFO L481 AbstractCegarLoop]: Abstraction has 26043 states and 31610 transitions. [2018-11-10 13:01:02,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:01:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 31610 transitions. [2018-11-10 13:01:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-10 13:01:02,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:02,541 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:02,541 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:02,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash 686637203, now seen corresponding path program 1 times [2018-11-10 13:01:02,542 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:02,542 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:02,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:03,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:03,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:01:03,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:01:03,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:01:03,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:01:03,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:03,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:03,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:01:03,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:01:03,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:01:03,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:03,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:01:03,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:03,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:01:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 243 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:03,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:03,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:01:03,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:01:03,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:01:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:01:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:01:03,334 INFO L87 Difference]: Start difference. First operand 26043 states and 31610 transitions. Second operand 11 states. [2018-11-10 13:01:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:05,780 INFO L93 Difference]: Finished difference Result 67407 states and 82542 transitions. [2018-11-10 13:01:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:01:05,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 296 [2018-11-10 13:01:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:05,814 INFO L225 Difference]: With dead ends: 67407 [2018-11-10 13:01:05,814 INFO L226 Difference]: Without dead ends: 41433 [2018-11-10 13:01:05,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 584 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:01:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41433 states. [2018-11-10 13:01:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41433 to 26339. [2018-11-10 13:01:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2018-11-10 13:01:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 31858 transitions. [2018-11-10 13:01:06,662 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 31858 transitions. Word has length 296 [2018-11-10 13:01:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:06,662 INFO L481 AbstractCegarLoop]: Abstraction has 26339 states and 31858 transitions. [2018-11-10 13:01:06,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:01:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 31858 transitions. [2018-11-10 13:01:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 13:01:06,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:06,674 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:06,674 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:06,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -765867021, now seen corresponding path program 1 times [2018-11-10 13:01:06,675 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:06,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:07,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:01:07,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:01:07,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:01:07,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:01:07,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:07,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:07,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:01:07,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:01:07,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:01:07,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:07,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:01:07,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:07,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:01:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 248 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:07,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:01:07,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:01:07,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:01:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:01:07,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:01:07,432 INFO L87 Difference]: Start difference. First operand 26339 states and 31858 transitions. Second operand 11 states. [2018-11-10 13:01:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:10,184 INFO L93 Difference]: Finished difference Result 68631 states and 83602 transitions. [2018-11-10 13:01:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:01:10,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-11-10 13:01:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:10,212 INFO L225 Difference]: With dead ends: 68631 [2018-11-10 13:01:10,212 INFO L226 Difference]: Without dead ends: 42361 [2018-11-10 13:01:10,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 586 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:01:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42361 states. [2018-11-10 13:01:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42361 to 26475. [2018-11-10 13:01:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26475 states. [2018-11-10 13:01:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26475 states to 26475 states and 31930 transitions. [2018-11-10 13:01:11,004 INFO L78 Accepts]: Start accepts. Automaton has 26475 states and 31930 transitions. Word has length 297 [2018-11-10 13:01:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:11,004 INFO L481 AbstractCegarLoop]: Abstraction has 26475 states and 31930 transitions. [2018-11-10 13:01:11,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:01:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26475 states and 31930 transitions. [2018-11-10 13:01:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 13:01:11,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:11,017 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:11,017 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:11,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1520350174, now seen corresponding path program 1 times [2018-11-10 13:01:11,018 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:11,018 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:11,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:11,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:11,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:01:11,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:01:11,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:01:11,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:01:11,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:11,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:11,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:01:11,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:01:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:01:11,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:11,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:01:11,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:11,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:01:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 218 proven. 4 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:11,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:11,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:01:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:01:11,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:01:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:01:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:01:11,745 INFO L87 Difference]: Start difference. First operand 26475 states and 31930 transitions. Second operand 11 states. [2018-11-10 13:01:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:14,319 INFO L93 Difference]: Finished difference Result 66331 states and 80756 transitions. [2018-11-10 13:01:14,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:01:14,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-11-10 13:01:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:14,347 INFO L225 Difference]: With dead ends: 66331 [2018-11-10 13:01:14,348 INFO L226 Difference]: Without dead ends: 39685 [2018-11-10 13:01:14,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 586 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:01:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39685 states. [2018-11-10 13:01:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39685 to 25087. [2018-11-10 13:01:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25087 states. [2018-11-10 13:01:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25087 states to 25087 states and 30018 transitions. [2018-11-10 13:01:15,163 INFO L78 Accepts]: Start accepts. Automaton has 25087 states and 30018 transitions. Word has length 297 [2018-11-10 13:01:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:15,164 INFO L481 AbstractCegarLoop]: Abstraction has 25087 states and 30018 transitions. [2018-11-10 13:01:15,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:01:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states and 30018 transitions. [2018-11-10 13:01:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-10 13:01:15,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:15,176 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:15,176 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:15,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1366717390, now seen corresponding path program 1 times [2018-11-10 13:01:15,177 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:15,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:15,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:15,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:01:15,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:01:15,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:01:15,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:01:15,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:15,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:15,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-10 13:01:15,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 13:01:15,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 13:01:15,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:01:15,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 13:01:15,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:15,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 13:01:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:15,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 13:01:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:01:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 13:01:16,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:01:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:01:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:01:16,066 INFO L87 Difference]: Start difference. First operand 25087 states and 30018 transitions. Second operand 11 states. [2018-11-10 13:01:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:18,344 INFO L93 Difference]: Finished difference Result 63551 states and 77000 transitions. [2018-11-10 13:01:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:01:18,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 299 [2018-11-10 13:01:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:18,375 INFO L225 Difference]: With dead ends: 63551 [2018-11-10 13:01:18,376 INFO L226 Difference]: Without dead ends: 38533 [2018-11-10 13:01:18,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:01:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38533 states. [2018-11-10 13:01:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38533 to 25351. [2018-11-10 13:01:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25351 states. [2018-11-10 13:01:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25351 states to 25351 states and 30250 transitions. [2018-11-10 13:01:19,340 INFO L78 Accepts]: Start accepts. Automaton has 25351 states and 30250 transitions. Word has length 299 [2018-11-10 13:01:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:19,340 INFO L481 AbstractCegarLoop]: Abstraction has 25351 states and 30250 transitions. [2018-11-10 13:01:19,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:01:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25351 states and 30250 transitions. [2018-11-10 13:01:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-10 13:01:19,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:19,351 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:19,351 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:19,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1784035617, now seen corresponding path program 1 times [2018-11-10 13:01:19,352 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:01:19,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:01:19,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:01:19,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:01:19,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 13:01:19,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 13:01:19,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-10 13:01:19,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-11-10 13:01:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 91 proven. 3 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-10 13:01:19,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:01:19,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 13:01:19,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-11-10 13:01:19,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:01:19,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:5 [2018-11-10 13:01:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 91 proven. 3 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-10 13:01:19,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:01:19,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 13:01:19,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:01:19,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:01:19,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:01:19,670 INFO L87 Difference]: Start difference. First operand 25351 states and 30250 transitions. Second operand 13 states. [2018-11-10 13:01:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:01:21,841 INFO L93 Difference]: Finished difference Result 51573 states and 61465 transitions. [2018-11-10 13:01:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:01:21,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 301 [2018-11-10 13:01:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:01:21,860 INFO L225 Difference]: With dead ends: 51573 [2018-11-10 13:01:21,860 INFO L226 Difference]: Without dead ends: 26291 [2018-11-10 13:01:21,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:01:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26291 states. [2018-11-10 13:01:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26291 to 25701. [2018-11-10 13:01:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25701 states. [2018-11-10 13:01:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25701 states to 25701 states and 30660 transitions. [2018-11-10 13:01:22,673 INFO L78 Accepts]: Start accepts. Automaton has 25701 states and 30660 transitions. Word has length 301 [2018-11-10 13:01:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:01:22,673 INFO L481 AbstractCegarLoop]: Abstraction has 25701 states and 30660 transitions. [2018-11-10 13:01:22,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:01:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25701 states and 30660 transitions. [2018-11-10 13:01:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 13:01:22,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:01:22,684 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:22,685 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:01:22,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:01:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -510788783, now seen corresponding path program 1 times [2018-11-10 13:01:22,685 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:01:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:01:22,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:01:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:01:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:01:24,506 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:01:24,553 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,554 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,555 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,555 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:01:24 BoogieIcfgContainer [2018-11-10 13:01:24,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:01:24,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:01:24,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:01:24,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:01:24,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:05" (3/4) ... [2018-11-10 13:01:24,617 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:01:24,638 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,638 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,639 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,639 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-10 13:01:24,718 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_217008cf-cefe-46bc-a515-cf1035f3428d/bin-2019/uautomizer/witness.graphml [2018-11-10 13:01:24,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:01:24,719 INFO L168 Benchmark]: Toolchain (without parser) took 81455.85 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 944.4 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 231.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:24,719 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:01:24,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 934.37 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 767.2 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:24,720 INFO L168 Benchmark]: Boogie Preprocessor took 140.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 767.2 MB in the beginning and 1.1 GB in the end (delta: -361.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:24,720 INFO L168 Benchmark]: RCFGBuilder took 1174.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:24,720 INFO L168 Benchmark]: TraceAbstraction took 79098.42 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 172.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:01:24,720 INFO L168 Benchmark]: Witness Printer took 103.80 ms. Allocated memory is still 3.3 GB. Free memory is still 3.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:01:24,721 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 934.37 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 767.2 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 140.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 767.2 MB in the beginning and 1.1 GB in the end (delta: -361.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1174.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79098.42 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 172.3 MB. Max. memory is 11.5 GB. * Witness Printer took 103.80 ms. Allocated memory is still 3.3 GB. Free memory is still 3.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1646]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; VAL [\old(init)=0, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={0:0}] [L1043] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=0, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-2006893746:0}] [L1065] EXPR, FCALL malloc(sizeof(SSL)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1069] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1070] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(SSL_SESSION))={-388993044:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1071] FCALL s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(SSL_SESSION))={-388993044:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1072] FCALL s->state = 12292 VAL [init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(SSL_SESSION))={-388993044:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1073] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=768, init=1, malloc(sizeof(SSL))={-388469251:0}, malloc(sizeof(SSL_CTX))={-187153163:0}, malloc(sizeof(SSL_SESSION))={-388993044:0}, malloc(sizeof(struct ssl3_state_st))={-1210589836:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1074] CALL ssl3_connect(s) VAL [init=1, s={-388469251:0}, SSLv3_client_data={-2006893746:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 VAL [blastFlag=0, buf={0:0}, init=1, s={-388469251:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1104] FCALL s->hit=__VERIFIER_nondet_int () VAL [__VERIFIER_nondet_int ()=0, blastFlag=0, buf={0:0}, init=1, s={-388469251:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1105] FCALL s->state = 12292 VAL [blastFlag=0, buf={0:0}, init=1, s={-388469251:0}, s={-388469251:0}, SSLv3_client_data={-2006893746:0}, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1110] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1112] cb = s->info_callback [L1120] EXPR, FCALL s->in_handshake VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->in_handshake=0, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1120] FCALL s->in_handshake += 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->in_handshake=0, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=12292, skip=0, SSLv3_client_data={-2006893746:0}, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=12292, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] FCALL s->new_session = 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1238] FCALL s->state = 4096 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1239] EXPR, FCALL s->ctx VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1239] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={1:0}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1239] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={1:0}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1244] FCALL s->server = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1250] EXPR, FCALL s->version VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->version=768, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] FCALL s->type = 4096 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1257] EXPR, FCALL s->init_buf VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->init_buf={1:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] FCALL s->state = 4368 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] EXPR, FCALL s->ctx VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [={1:0}, (s->ctx)->stats.sess_connect=0, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] FCALL (s->ctx)->stats.sess_connect += 1 VAL [={1:0}, (s->ctx)->stats.sess_connect=0, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->ctx={-187153163:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1285] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=12292, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, s->state=4368, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] FCALL s->shutdown = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1301] FCALL s->state = 4384 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] EXPR, FCALL s->bbio VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->bbio={0:196608}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] EXPR, FCALL s->wbio VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->bbio={0:196608}, s->wbio={0:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4368, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4384, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] FCALL s->hit VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->hit=0, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] FCALL s->state = 4400 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4384, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4400, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [={1:0}, (s->s3)->tmp.new_cipher={-187153163:40}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={-187153163:40}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->state = 4416 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1347] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4400, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4416, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] FCALL s->state = 4432 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1363] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4416, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4432, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1385] FCALL s->state = 4448 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1386] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->s3={-1210589836:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4432, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-388469251:0}, s={-388469251:0}, s->state=4448, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=0, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1646] __VERIFIER_error() VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=0, s={-388469251:0}, s={-388469251:0}, skip=0, SSLv3_client_data={-2006893746:0}, state=4448, tmp=0, tmp___0={-2006893746:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 383 locations, 1 error locations. UNSAFE Result, 79.0s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 52.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11400 SDtfs, 24262 SDslu, 45380 SDs, 0 SdLazy, 31785 SolverSat, 2420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11106 GetRequests, 10734 SyntacticMatches, 21 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26475occurred in iteration=23, 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: 9.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 166952 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 6751 NumberOfCodeBlocks, 6751 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 10880 ConstructedInterpolants, 1 QuantifiedInterpolants, 9931880 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9567 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 12319/12506 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...