./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan --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 Taipan --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_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan --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 Taipan --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-5842f4b [2018-11-18 09:55:03,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:55:03,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:55:03,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:55:03,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:55:03,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:55:03,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:55:03,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:55:03,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:55:03,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:55:03,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:55:03,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:55:03,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:55:03,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:55:03,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:55:03,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:55:03,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:55:03,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:55:03,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:55:03,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:55:03,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:55:03,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:55:03,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:55:03,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:55:03,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:55:03,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:55:03,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:55:03,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:55:03,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:55:03,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:55:03,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:55:03,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:55:03,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:55:03,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:55:03,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:55:03,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:55:03,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:55:03,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:55:03,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:55:03,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:55:03,099 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:55:03,099 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:55:03,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:55:03,100 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:55:03,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:55:03,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:55:03,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:55:03,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:55:03,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:55:03,103 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan 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 -> Taipan 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-18 09:55:03,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:55:03,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:55:03,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:55:03,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:55:03,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:55:03,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:03,171 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/70e351308/51d526697c2c4caaa746a1775e3ade7c/FLAG8628885e8 [2018-11-18 09:55:03,542 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:55:03,542 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:03,554 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/70e351308/51d526697c2c4caaa746a1775e3ade7c/FLAG8628885e8 [2018-11-18 09:55:03,562 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/70e351308/51d526697c2c4caaa746a1775e3ade7c [2018-11-18 09:55:03,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:55:03,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:55:03,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:55:03,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:55:03,568 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:55:03,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:03" (1/1) ... [2018-11-18 09:55:03,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7213d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:03, skipping insertion in model container [2018-11-18 09:55:03,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:03" (1/1) ... [2018-11-18 09:55:03,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:55:03,620 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:55:04,112 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:55:04,121 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:55:04,447 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:55:04,462 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:55:04,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04 WrapperNode [2018-11-18 09:55:04,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:55:04,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:55:04,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:55:04,463 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:55:04,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:55:04,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:55:04,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:55:04,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:55:04,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... [2018-11-18 09:55:04,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:55:04,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:55:04,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:55:04,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:55:04,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:55:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:55:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:55:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 09:55:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:55:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:55:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:55:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:55:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:55:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 09:55:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 09:55:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:55:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:55:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:55:04,931 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:55:04,931 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:55:05,318 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:55:05,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:05 BoogieIcfgContainer [2018-11-18 09:55:05,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:55:05,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:55:05,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:55:05,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:55:05,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:55:03" (1/3) ... [2018-11-18 09:55:05,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176c11a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:05, skipping insertion in model container [2018-11-18 09:55:05,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:04" (2/3) ... [2018-11-18 09:55:05,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176c11a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:05, skipping insertion in model container [2018-11-18 09:55:05,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:05" (3/3) ... [2018-11-18 09:55:05,326 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:05,334 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:55:05,340 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:55:05,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:55:05,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:55:05,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:55:05,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:55:05,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:55:05,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:55:05,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:55:05,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:55:05,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:55:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-18 09:55:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 09:55:05,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:05,399 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] [2018-11-18 09:55:05,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:05,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash -244527418, now seen corresponding path program 1 times [2018-11-18 09:55:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:05,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:05,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:05,614 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-18 09:55:05,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:05,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:05,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:05,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:05,634 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-18 09:55:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:05,735 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-18 09:55:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:05,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 09:55:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:05,747 INFO L225 Difference]: With dead ends: 388 [2018-11-18 09:55:05,747 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 09:55:05,750 INFO L604 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-18 09:55:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 09:55:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-18 09:55:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 09:55:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-18 09:55:05,797 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-18 09:55:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:05,797 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-18 09:55:05,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-18 09:55:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 09:55:05,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:05,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:05,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:05,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1281881606, now seen corresponding path program 1 times [2018-11-18 09:55:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:55:05,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:05,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:05,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:05,883 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-18 09:55:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:05,932 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-18 09:55:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:05,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 09:55:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:05,934 INFO L225 Difference]: With dead ends: 436 [2018-11-18 09:55:05,934 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 09:55:05,935 INFO L604 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-18 09:55:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 09:55:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-18 09:55:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 09:55:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-18 09:55:05,948 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-18 09:55:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:05,949 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-18 09:55:05,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-18 09:55:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 09:55:05,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:05,951 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:05,951 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:05,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash 854628109, now seen corresponding path program 1 times [2018-11-18 09:55:05,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:05,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:05,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:06,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:06,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:06,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:06,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:06,074 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 4 states. [2018-11-18 09:55:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:06,488 INFO L93 Difference]: Finished difference Result 833 states and 1224 transitions. [2018-11-18 09:55:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:06,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-18 09:55:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:06,491 INFO L225 Difference]: With dead ends: 833 [2018-11-18 09:55:06,491 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 09:55:06,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 09:55:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2018-11-18 09:55:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-18 09:55:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 567 transitions. [2018-11-18 09:55:06,515 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 567 transitions. Word has length 66 [2018-11-18 09:55:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:06,516 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 567 transitions. [2018-11-18 09:55:06,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 567 transitions. [2018-11-18 09:55:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 09:55:06,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:06,520 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:06,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:06,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash 995176719, now seen corresponding path program 1 times [2018-11-18 09:55:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:06,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:06,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:06,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:06,609 INFO L87 Difference]: Start difference. First operand 380 states and 567 transitions. Second operand 4 states. [2018-11-18 09:55:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:06,834 INFO L93 Difference]: Finished difference Result 833 states and 1244 transitions. [2018-11-18 09:55:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:06,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-18 09:55:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:06,837 INFO L225 Difference]: With dead ends: 833 [2018-11-18 09:55:06,837 INFO L226 Difference]: Without dead ends: 466 [2018-11-18 09:55:06,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-18 09:55:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 422. [2018-11-18 09:55:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-18 09:55:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2018-11-18 09:55:06,852 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 66 [2018-11-18 09:55:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2018-11-18 09:55:06,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2018-11-18 09:55:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 09:55:06,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:06,855 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:06,855 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:06,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash 719249705, now seen corresponding path program 1 times [2018-11-18 09:55:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:06,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:06,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:06,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:06,926 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2018-11-18 09:55:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:07,298 INFO L93 Difference]: Finished difference Result 963 states and 1443 transitions. [2018-11-18 09:55:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:07,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-18 09:55:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:07,301 INFO L225 Difference]: With dead ends: 963 [2018-11-18 09:55:07,301 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 09:55:07,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 09:55:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 424. [2018-11-18 09:55:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-18 09:55:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 639 transitions. [2018-11-18 09:55:07,317 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 639 transitions. Word has length 67 [2018-11-18 09:55:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 639 transitions. [2018-11-18 09:55:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 639 transitions. [2018-11-18 09:55:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 09:55:07,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:07,319 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:07,319 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:07,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 817647336, now seen corresponding path program 1 times [2018-11-18 09:55:07,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:07,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:07,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:07,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:07,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:07,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:07,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:07,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:07,380 INFO L87 Difference]: Start difference. First operand 424 states and 639 transitions. Second operand 4 states. [2018-11-18 09:55:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:07,843 INFO L93 Difference]: Finished difference Result 965 states and 1443 transitions. [2018-11-18 09:55:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:07,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 09:55:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:07,849 INFO L225 Difference]: With dead ends: 965 [2018-11-18 09:55:07,849 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 09:55:07,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 09:55:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 426. [2018-11-18 09:55:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-18 09:55:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 641 transitions. [2018-11-18 09:55:07,862 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 641 transitions. Word has length 68 [2018-11-18 09:55:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:07,863 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 641 transitions. [2018-11-18 09:55:07,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 641 transitions. [2018-11-18 09:55:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 09:55:07,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:07,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:07,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:07,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -427213468, now seen corresponding path program 1 times [2018-11-18 09:55:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:07,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:07,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:07,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:07,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:07,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:07,920 INFO L87 Difference]: Start difference. First operand 426 states and 641 transitions. Second operand 4 states. [2018-11-18 09:55:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:08,408 INFO L93 Difference]: Finished difference Result 957 states and 1431 transitions. [2018-11-18 09:55:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:08,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 09:55:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:08,411 INFO L225 Difference]: With dead ends: 957 [2018-11-18 09:55:08,411 INFO L226 Difference]: Without dead ends: 544 [2018-11-18 09:55:08,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-18 09:55:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 428. [2018-11-18 09:55:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 643 transitions. [2018-11-18 09:55:08,423 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 643 transitions. Word has length 69 [2018-11-18 09:55:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:08,423 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 643 transitions. [2018-11-18 09:55:08,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 643 transitions. [2018-11-18 09:55:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:08,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:08,424 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:08,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:08,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash -513203296, now seen corresponding path program 1 times [2018-11-18 09:55:08,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:08,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:08,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:08,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:08,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:08,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:08,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:08,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:08,480 INFO L87 Difference]: Start difference. First operand 428 states and 643 transitions. Second operand 4 states. [2018-11-18 09:55:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:08,855 INFO L93 Difference]: Finished difference Result 957 states and 1429 transitions. [2018-11-18 09:55:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:08,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:08,857 INFO L225 Difference]: With dead ends: 957 [2018-11-18 09:55:08,858 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 09:55:08,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 09:55:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 09:55:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 641 transitions. [2018-11-18 09:55:08,871 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 641 transitions. Word has length 82 [2018-11-18 09:55:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:08,871 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 641 transitions. [2018-11-18 09:55:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 641 transitions. [2018-11-18 09:55:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:08,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:08,872 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:08,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1091522494, now seen corresponding path program 1 times [2018-11-18 09:55:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:08,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:08,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:08,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:08,942 INFO L87 Difference]: Start difference. First operand 428 states and 641 transitions. Second operand 4 states. [2018-11-18 09:55:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:09,485 INFO L93 Difference]: Finished difference Result 957 states and 1425 transitions. [2018-11-18 09:55:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:09,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:09,488 INFO L225 Difference]: With dead ends: 957 [2018-11-18 09:55:09,488 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 09:55:09,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 09:55:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 09:55:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 639 transitions. [2018-11-18 09:55:09,503 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 639 transitions. Word has length 82 [2018-11-18 09:55:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:09,503 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 639 transitions. [2018-11-18 09:55:09,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 639 transitions. [2018-11-18 09:55:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:09,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:09,504 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:09,505 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:09,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1487205761, now seen corresponding path program 1 times [2018-11-18 09:55:09,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:09,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:09,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:09,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:09,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:09,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:09,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:09,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:09,564 INFO L87 Difference]: Start difference. First operand 428 states and 639 transitions. Second operand 4 states. [2018-11-18 09:55:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:09,818 INFO L93 Difference]: Finished difference Result 805 states and 1192 transitions. [2018-11-18 09:55:09,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:09,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:09,821 INFO L225 Difference]: With dead ends: 805 [2018-11-18 09:55:09,821 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 09:55:09,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 09:55:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 09:55:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 637 transitions. [2018-11-18 09:55:09,836 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 637 transitions. Word has length 82 [2018-11-18 09:55:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:09,836 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 637 transitions. [2018-11-18 09:55:09,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 637 transitions. [2018-11-18 09:55:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:09,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:09,838 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:09,838 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:09,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash -89556574, now seen corresponding path program 1 times [2018-11-18 09:55:09,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:09,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:09,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:09,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:09,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:09,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:09,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:09,912 INFO L87 Difference]: Start difference. First operand 428 states and 637 transitions. Second operand 4 states. [2018-11-18 09:55:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:10,152 INFO L93 Difference]: Finished difference Result 885 states and 1310 transitions. [2018-11-18 09:55:10,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:10,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:10,154 INFO L225 Difference]: With dead ends: 885 [2018-11-18 09:55:10,154 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 09:55:10,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 09:55:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 09:55:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 635 transitions. [2018-11-18 09:55:10,170 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 635 transitions. Word has length 82 [2018-11-18 09:55:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:10,170 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 635 transitions. [2018-11-18 09:55:10,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 635 transitions. [2018-11-18 09:55:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:10,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:10,171 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:10,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:10,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash -667875772, now seen corresponding path program 1 times [2018-11-18 09:55:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:10,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:10,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:10,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:10,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:10,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:10,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:10,237 INFO L87 Difference]: Start difference. First operand 428 states and 635 transitions. Second operand 4 states. [2018-11-18 09:55:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:10,693 INFO L93 Difference]: Finished difference Result 885 states and 1306 transitions. [2018-11-18 09:55:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:10,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:10,695 INFO L225 Difference]: With dead ends: 885 [2018-11-18 09:55:10,695 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 09:55:10,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 09:55:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 09:55:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2018-11-18 09:55:10,709 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 82 [2018-11-18 09:55:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:10,709 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2018-11-18 09:55:10,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2018-11-18 09:55:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 09:55:10,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:10,711 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:10,711 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:10,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1063559039, now seen corresponding path program 1 times [2018-11-18 09:55:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:10,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:10,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:10,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:10,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:10,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:10,767 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2018-11-18 09:55:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:11,155 INFO L93 Difference]: Finished difference Result 733 states and 1076 transitions. [2018-11-18 09:55:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:11,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 09:55:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:11,157 INFO L225 Difference]: With dead ends: 733 [2018-11-18 09:55:11,157 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 09:55:11,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 09:55:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 09:55:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2018-11-18 09:55:11,170 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 82 [2018-11-18 09:55:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:11,170 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2018-11-18 09:55:11,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2018-11-18 09:55:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:55:11,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:11,172 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:11,172 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:11,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1752725986, now seen corresponding path program 1 times [2018-11-18 09:55:11,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:11,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:11,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:11,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:11,218 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2018-11-18 09:55:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:11,539 INFO L93 Difference]: Finished difference Result 957 states and 1405 transitions. [2018-11-18 09:55:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:11,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 09:55:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:11,541 INFO L225 Difference]: With dead ends: 957 [2018-11-18 09:55:11,541 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 09:55:11,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 09:55:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 09:55:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2018-11-18 09:55:11,556 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 83 [2018-11-18 09:55:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:11,557 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2018-11-18 09:55:11,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2018-11-18 09:55:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:55:11,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:11,558 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 09:55:11,558 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:11,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1853996827, now seen corresponding path program 1 times [2018-11-18 09:55:11,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:11,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:11,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:11,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:11,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:11,607 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2018-11-18 09:55:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:11,808 INFO L93 Difference]: Finished difference Result 799 states and 1170 transitions. [2018-11-18 09:55:11,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:11,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 09:55:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:11,809 INFO L225 Difference]: With dead ends: 799 [2018-11-18 09:55:11,809 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 09:55:11,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 09:55:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 428. [2018-11-18 09:55:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2018-11-18 09:55:11,818 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 83 [2018-11-18 09:55:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:11,818 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2018-11-18 09:55:11,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2018-11-18 09:55:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:55:11,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:11,820 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:11,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:11,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1504579492, now seen corresponding path program 1 times [2018-11-18 09:55:11,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:11,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:11,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:11,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:11,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:11,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:11,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:11,853 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 4 states. [2018-11-18 09:55:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:12,008 INFO L93 Difference]: Finished difference Result 885 states and 1290 transitions. [2018-11-18 09:55:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:12,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 09:55:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:12,010 INFO L225 Difference]: With dead ends: 885 [2018-11-18 09:55:12,010 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 09:55:12,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 09:55:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 09:55:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2018-11-18 09:55:12,019 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 83 [2018-11-18 09:55:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:12,019 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2018-11-18 09:55:12,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2018-11-18 09:55:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:55:12,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:12,021 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 09:55:12,021 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:12,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2102143321, now seen corresponding path program 1 times [2018-11-18 09:55:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:12,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:12,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:12,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:12,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:12,054 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 4 states. [2018-11-18 09:55:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:12,344 INFO L93 Difference]: Finished difference Result 727 states and 1057 transitions. [2018-11-18 09:55:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:12,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 09:55:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:12,346 INFO L225 Difference]: With dead ends: 727 [2018-11-18 09:55:12,347 INFO L226 Difference]: Without dead ends: 464 [2018-11-18 09:55:12,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-18 09:55:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 428. [2018-11-18 09:55:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 623 transitions. [2018-11-18 09:55:12,359 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 623 transitions. Word has length 83 [2018-11-18 09:55:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:12,359 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 623 transitions. [2018-11-18 09:55:12,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2018-11-18 09:55:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 09:55:12,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:12,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:12,360 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:12,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2059184925, now seen corresponding path program 1 times [2018-11-18 09:55:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:12,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:12,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:12,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:12,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:12,424 INFO L87 Difference]: Start difference. First operand 428 states and 623 transitions. Second operand 4 states. [2018-11-18 09:55:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:12,701 INFO L93 Difference]: Finished difference Result 951 states and 1382 transitions. [2018-11-18 09:55:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:12,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-18 09:55:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:12,702 INFO L225 Difference]: With dead ends: 951 [2018-11-18 09:55:12,702 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 09:55:12,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 09:55:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 428. [2018-11-18 09:55:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-11-18 09:55:12,714 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 84 [2018-11-18 09:55:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:12,714 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-11-18 09:55:12,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-11-18 09:55:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 09:55:12,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:12,716 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:12,716 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:12,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1161791647, now seen corresponding path program 1 times [2018-11-18 09:55:12,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:12,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:12,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:12,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:12,792 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 4 states. [2018-11-18 09:55:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:12,982 INFO L93 Difference]: Finished difference Result 879 states and 1271 transitions. [2018-11-18 09:55:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:12,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-18 09:55:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:12,983 INFO L225 Difference]: With dead ends: 879 [2018-11-18 09:55:12,983 INFO L226 Difference]: Without dead ends: 464 [2018-11-18 09:55:12,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-18 09:55:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 428. [2018-11-18 09:55:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 619 transitions. [2018-11-18 09:55:12,991 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 619 transitions. Word has length 84 [2018-11-18 09:55:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:12,991 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 619 transitions. [2018-11-18 09:55:12,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 619 transitions. [2018-11-18 09:55:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:55:12,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:12,993 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:12,993 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:12,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1491245735, now seen corresponding path program 1 times [2018-11-18 09:55:12,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:12,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:13,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:13,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:13,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:13,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:13,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:13,033 INFO L87 Difference]: Start difference. First operand 428 states and 619 transitions. Second operand 4 states. [2018-11-18 09:55:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:13,182 INFO L93 Difference]: Finished difference Result 933 states and 1352 transitions. [2018-11-18 09:55:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:13,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 09:55:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:13,184 INFO L225 Difference]: With dead ends: 933 [2018-11-18 09:55:13,184 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 09:55:13,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 09:55:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 428. [2018-11-18 09:55:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 617 transitions. [2018-11-18 09:55:13,197 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 617 transitions. Word has length 85 [2018-11-18 09:55:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:13,197 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 617 transitions. [2018-11-18 09:55:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 617 transitions. [2018-11-18 09:55:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:55:13,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:13,199 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:13,199 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:13,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1909092392, now seen corresponding path program 1 times [2018-11-18 09:55:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:13,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:13,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:13,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:13,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:13,263 INFO L87 Difference]: Start difference. First operand 428 states and 617 transitions. Second operand 4 states. [2018-11-18 09:55:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:13,858 INFO L93 Difference]: Finished difference Result 933 states and 1348 transitions. [2018-11-18 09:55:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:13,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 09:55:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:13,860 INFO L225 Difference]: With dead ends: 933 [2018-11-18 09:55:13,860 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 09:55:13,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 09:55:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 428. [2018-11-18 09:55:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 615 transitions. [2018-11-18 09:55:13,872 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 615 transitions. Word has length 85 [2018-11-18 09:55:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:13,873 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 615 transitions. [2018-11-18 09:55:13,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 615 transitions. [2018-11-18 09:55:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:55:13,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:13,874 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:13,874 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:13,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 754333719, now seen corresponding path program 1 times [2018-11-18 09:55:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:13,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:13,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:13,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:13,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:13,937 INFO L87 Difference]: Start difference. First operand 428 states and 615 transitions. Second operand 4 states. [2018-11-18 09:55:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:14,087 INFO L93 Difference]: Finished difference Result 861 states and 1237 transitions. [2018-11-18 09:55:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:14,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 09:55:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:14,088 INFO L225 Difference]: With dead ends: 861 [2018-11-18 09:55:14,088 INFO L226 Difference]: Without dead ends: 446 [2018-11-18 09:55:14,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 09:55:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-18 09:55:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 428. [2018-11-18 09:55:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:55:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 613 transitions. [2018-11-18 09:55:14,101 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 613 transitions. Word has length 85 [2018-11-18 09:55:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:14,101 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 613 transitions. [2018-11-18 09:55:14,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 613 transitions. [2018-11-18 09:55:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:55:14,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:14,102 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:14,102 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:14,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash -140295450, now seen corresponding path program 1 times [2018-11-18 09:55:14,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:14,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 09:55:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:14,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:14,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:14,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:14,143 INFO L87 Difference]: Start difference. First operand 428 states and 613 transitions. Second operand 3 states. [2018-11-18 09:55:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:14,176 INFO L93 Difference]: Finished difference Result 845 states and 1218 transitions. [2018-11-18 09:55:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:14,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 09:55:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:14,178 INFO L225 Difference]: With dead ends: 845 [2018-11-18 09:55:14,178 INFO L226 Difference]: Without dead ends: 584 [2018-11-18 09:55:14,178 INFO L604 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-18 09:55:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-18 09:55:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2018-11-18 09:55:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-18 09:55:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 837 transitions. [2018-11-18 09:55:14,188 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 837 transitions. Word has length 85 [2018-11-18 09:55:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:14,188 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 837 transitions. [2018-11-18 09:55:14,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 837 transitions. [2018-11-18 09:55:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 09:55:14,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:14,189 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:14,190 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:14,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -411204112, now seen corresponding path program 1 times [2018-11-18 09:55:14,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:55:14,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:14,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:14,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:14,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:14,223 INFO L87 Difference]: Start difference. First operand 584 states and 837 transitions. Second operand 3 states. [2018-11-18 09:55:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:14,251 INFO L93 Difference]: Finished difference Result 742 states and 1065 transitions. [2018-11-18 09:55:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:14,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-18 09:55:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:14,253 INFO L225 Difference]: With dead ends: 742 [2018-11-18 09:55:14,253 INFO L226 Difference]: Without dead ends: 740 [2018-11-18 09:55:14,253 INFO L604 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-18 09:55:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-18 09:55:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-11-18 09:55:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-18 09:55:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1062 transitions. [2018-11-18 09:55:14,264 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1062 transitions. Word has length 87 [2018-11-18 09:55:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:14,264 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 1062 transitions. [2018-11-18 09:55:14,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1062 transitions. [2018-11-18 09:55:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 09:55:14,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:14,266 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:14,266 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:14,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 225792755, now seen corresponding path program 1 times [2018-11-18 09:55:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:14,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:14,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:14,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:14,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:14,304 INFO L87 Difference]: Start difference. First operand 740 states and 1062 transitions. Second operand 3 states. [2018-11-18 09:55:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:14,329 INFO L93 Difference]: Finished difference Result 742 states and 1063 transitions. [2018-11-18 09:55:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:14,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-18 09:55:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:14,331 INFO L225 Difference]: With dead ends: 742 [2018-11-18 09:55:14,331 INFO L226 Difference]: Without dead ends: 740 [2018-11-18 09:55:14,332 INFO L604 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-18 09:55:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-18 09:55:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-11-18 09:55:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-18 09:55:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1061 transitions. [2018-11-18 09:55:14,342 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1061 transitions. Word has length 109 [2018-11-18 09:55:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:14,343 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 1061 transitions. [2018-11-18 09:55:14,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1061 transitions. [2018-11-18 09:55:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 09:55:14,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:14,344 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:14,345 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:14,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2097260878, now seen corresponding path program 1 times [2018-11-18 09:55:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:14,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:14,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:14,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:14,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:14,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:14,446 INFO L87 Difference]: Start difference. First operand 740 states and 1061 transitions. Second operand 4 states. [2018-11-18 09:55:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:14,690 INFO L93 Difference]: Finished difference Result 1729 states and 2492 transitions. [2018-11-18 09:55:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:14,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-18 09:55:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:14,693 INFO L225 Difference]: With dead ends: 1729 [2018-11-18 09:55:14,693 INFO L226 Difference]: Without dead ends: 1002 [2018-11-18 09:55:14,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-18 09:55:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 865. [2018-11-18 09:55:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 09:55:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1276 transitions. [2018-11-18 09:55:14,714 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1276 transitions. Word has length 111 [2018-11-18 09:55:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:14,714 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1276 transitions. [2018-11-18 09:55:14,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1276 transitions. [2018-11-18 09:55:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:14,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:14,716 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:14,716 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:14,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash 558092577, now seen corresponding path program 1 times [2018-11-18 09:55:14,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:14,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:14,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:14,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:14,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:14,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:14,791 INFO L87 Difference]: Start difference. First operand 865 states and 1276 transitions. Second operand 4 states. [2018-11-18 09:55:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:15,035 INFO L93 Difference]: Finished difference Result 1849 states and 2697 transitions. [2018-11-18 09:55:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:15,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 09:55:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:15,039 INFO L225 Difference]: With dead ends: 1849 [2018-11-18 09:55:15,039 INFO L226 Difference]: Without dead ends: 997 [2018-11-18 09:55:15,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-18 09:55:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 865. [2018-11-18 09:55:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 09:55:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1271 transitions. [2018-11-18 09:55:15,060 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1271 transitions. Word has length 127 [2018-11-18 09:55:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:15,060 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1271 transitions. [2018-11-18 09:55:15,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1271 transitions. [2018-11-18 09:55:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:15,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:15,062 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:15,062 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:15,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1155875517, now seen corresponding path program 1 times [2018-11-18 09:55:15,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:15,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:15,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:15,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:15,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:15,114 INFO L87 Difference]: Start difference. First operand 865 states and 1271 transitions. Second operand 4 states. [2018-11-18 09:55:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:15,602 INFO L93 Difference]: Finished difference Result 1849 states and 2687 transitions. [2018-11-18 09:55:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:15,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 09:55:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:15,605 INFO L225 Difference]: With dead ends: 1849 [2018-11-18 09:55:15,605 INFO L226 Difference]: Without dead ends: 997 [2018-11-18 09:55:15,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-18 09:55:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 865. [2018-11-18 09:55:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 09:55:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1266 transitions. [2018-11-18 09:55:15,620 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1266 transitions. Word has length 127 [2018-11-18 09:55:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:15,620 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1266 transitions. [2018-11-18 09:55:15,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1266 transitions. [2018-11-18 09:55:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:15,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:15,622 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:15,622 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:15,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 844594240, now seen corresponding path program 1 times [2018-11-18 09:55:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-18 09:55:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:15,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:15,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:15,690 INFO L87 Difference]: Start difference. First operand 865 states and 1266 transitions. Second operand 4 states. [2018-11-18 09:55:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:15,840 INFO L93 Difference]: Finished difference Result 1680 states and 2467 transitions. [2018-11-18 09:55:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:15,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 09:55:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:15,842 INFO L225 Difference]: With dead ends: 1680 [2018-11-18 09:55:15,842 INFO L226 Difference]: Without dead ends: 1007 [2018-11-18 09:55:15,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2018-11-18 09:55:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 941. [2018-11-18 09:55:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1390 transitions. [2018-11-18 09:55:15,856 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1390 transitions. Word has length 127 [2018-11-18 09:55:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:15,856 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1390 transitions. [2018-11-18 09:55:15,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1390 transitions. [2018-11-18 09:55:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 09:55:15,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:15,857 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:15,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:15,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1924285421, now seen corresponding path program 1 times [2018-11-18 09:55:15,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:15,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:15,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:15,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:15,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:15,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:15,917 INFO L87 Difference]: Start difference. First operand 941 states and 1390 transitions. Second operand 4 states. [2018-11-18 09:55:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:16,276 INFO L93 Difference]: Finished difference Result 2001 states and 2925 transitions. [2018-11-18 09:55:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:16,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-18 09:55:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:16,279 INFO L225 Difference]: With dead ends: 2001 [2018-11-18 09:55:16,279 INFO L226 Difference]: Without dead ends: 1073 [2018-11-18 09:55:16,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-11-18 09:55:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 941. [2018-11-18 09:55:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1385 transitions. [2018-11-18 09:55:16,302 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1385 transitions. Word has length 128 [2018-11-18 09:55:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:16,302 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1385 transitions. [2018-11-18 09:55:16,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1385 transitions. [2018-11-18 09:55:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 09:55:16,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:16,303 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:16,303 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:16,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 857304030, now seen corresponding path program 1 times [2018-11-18 09:55:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:16,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:16,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:16,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:16,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:16,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:16,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:16,352 INFO L87 Difference]: Start difference. First operand 941 states and 1385 transitions. Second operand 4 states. [2018-11-18 09:55:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:16,511 INFO L93 Difference]: Finished difference Result 2001 states and 2915 transitions. [2018-11-18 09:55:16,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:16,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-18 09:55:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:16,515 INFO L225 Difference]: With dead ends: 2001 [2018-11-18 09:55:16,515 INFO L226 Difference]: Without dead ends: 1073 [2018-11-18 09:55:16,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-11-18 09:55:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 941. [2018-11-18 09:55:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1380 transitions. [2018-11-18 09:55:16,537 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1380 transitions. Word has length 129 [2018-11-18 09:55:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:16,537 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1380 transitions. [2018-11-18 09:55:16,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1380 transitions. [2018-11-18 09:55:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 09:55:16,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:16,538 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:16,538 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:16,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2019723790, now seen corresponding path program 1 times [2018-11-18 09:55:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:16,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:16,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:16,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:16,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:16,586 INFO L87 Difference]: Start difference. First operand 941 states and 1380 transitions. Second operand 4 states. [2018-11-18 09:55:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:16,802 INFO L93 Difference]: Finished difference Result 1956 states and 2850 transitions. [2018-11-18 09:55:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:16,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-18 09:55:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:16,804 INFO L225 Difference]: With dead ends: 1956 [2018-11-18 09:55:16,804 INFO L226 Difference]: Without dead ends: 1028 [2018-11-18 09:55:16,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-11-18 09:55:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 941. [2018-11-18 09:55:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1375 transitions. [2018-11-18 09:55:16,822 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1375 transitions. Word has length 130 [2018-11-18 09:55:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:16,822 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1375 transitions. [2018-11-18 09:55:16,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1375 transitions. [2018-11-18 09:55:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 09:55:16,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:16,824 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2018-11-18 09:55:16,824 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:16,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1274551581, now seen corresponding path program 1 times [2018-11-18 09:55:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:16,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:16,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:16,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:16,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:16,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:16,884 INFO L87 Difference]: Start difference. First operand 941 states and 1375 transitions. Second operand 4 states. [2018-11-18 09:55:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:17,093 INFO L93 Difference]: Finished difference Result 1956 states and 2840 transitions. [2018-11-18 09:55:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:17,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-18 09:55:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:17,096 INFO L225 Difference]: With dead ends: 1956 [2018-11-18 09:55:17,097 INFO L226 Difference]: Without dead ends: 1028 [2018-11-18 09:55:17,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-11-18 09:55:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 941. [2018-11-18 09:55:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1370 transitions. [2018-11-18 09:55:17,116 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1370 transitions. Word has length 130 [2018-11-18 09:55:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:17,116 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1370 transitions. [2018-11-18 09:55:17,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1370 transitions. [2018-11-18 09:55:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 09:55:17,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:17,117 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-11-18 09:55:17,118 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:17,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash 974405325, now seen corresponding path program 1 times [2018-11-18 09:55:17,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:17,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:17,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:17,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:17,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:55:17,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:17,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:55:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:55:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:55:17,189 INFO L87 Difference]: Start difference. First operand 941 states and 1370 transitions. Second operand 4 states. [2018-11-18 09:55:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:17,350 INFO L93 Difference]: Finished difference Result 1931 states and 2797 transitions. [2018-11-18 09:55:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:55:17,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-18 09:55:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:17,353 INFO L225 Difference]: With dead ends: 1931 [2018-11-18 09:55:17,353 INFO L226 Difference]: Without dead ends: 1003 [2018-11-18 09:55:17,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:55:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-18 09:55:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 941. [2018-11-18 09:55:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 09:55:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1365 transitions. [2018-11-18 09:55:17,380 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1365 transitions. Word has length 131 [2018-11-18 09:55:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:17,380 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1365 transitions. [2018-11-18 09:55:17,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:55:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1365 transitions. [2018-11-18 09:55:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 09:55:17,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:17,381 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:17,382 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:17,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -923959797, now seen corresponding path program 1 times [2018-11-18 09:55:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:17,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:17,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:17,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:17,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-18 09:55:17,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:17,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:55:17,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:17,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:55:17,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:55:17,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:55:17,483 INFO L87 Difference]: Start difference. First operand 941 states and 1365 transitions. Second operand 6 states. [2018-11-18 09:55:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:18,021 INFO L93 Difference]: Finished difference Result 1777 states and 2585 transitions. [2018-11-18 09:55:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:55:18,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-18 09:55:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:18,023 INFO L225 Difference]: With dead ends: 1777 [2018-11-18 09:55:18,023 INFO L226 Difference]: Without dead ends: 1026 [2018-11-18 09:55:18,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:55:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-11-18 09:55:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 950. [2018-11-18 09:55:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-11-18 09:55:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1379 transitions. [2018-11-18 09:55:18,039 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1379 transitions. Word has length 134 [2018-11-18 09:55:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:18,039 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1379 transitions. [2018-11-18 09:55:18,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:55:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1379 transitions. [2018-11-18 09:55:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 09:55:18,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:18,041 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:18,041 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:18,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1318978943, now seen corresponding path program 1 times [2018-11-18 09:55:18,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:18,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:18,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-18 09:55:18,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:18,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:55:18,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:55:18,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:55:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:55:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:55:18,132 INFO L87 Difference]: Start difference. First operand 950 states and 1379 transitions. Second operand 6 states. [2018-11-18 09:55:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:18,492 INFO L93 Difference]: Finished difference Result 1774 states and 2581 transitions. [2018-11-18 09:55:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:55:18,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-18 09:55:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:18,494 INFO L225 Difference]: With dead ends: 1774 [2018-11-18 09:55:18,494 INFO L226 Difference]: Without dead ends: 1023 [2018-11-18 09:55:18,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:55:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-11-18 09:55:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 951. [2018-11-18 09:55:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-11-18 09:55:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1380 transitions. [2018-11-18 09:55:18,509 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1380 transitions. Word has length 135 [2018-11-18 09:55:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:18,509 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1380 transitions. [2018-11-18 09:55:18,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:55:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1380 transitions. [2018-11-18 09:55:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 09:55:18,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:18,510 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:18,510 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:18,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1323914216, now seen corresponding path program 1 times [2018-11-18 09:55:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:55:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:55:18,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:55:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:18,739 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:55:18,776 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-18 09:55:18,777 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20487 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-18 09:55:18,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:55:18 BoogieIcfgContainer [2018-11-18 09:55:18,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:55:18,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:55:18,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:55:18,817 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:55:18,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:05" (3/4) ... [2018-11-18 09:55:18,821 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:55:18,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:55:18,821 INFO L168 Benchmark]: Toolchain (without parser) took 15256.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 957.5 MB in the beginning and 891.7 MB in the end (delta: 65.8 MB). Peak memory consumption was 452.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,822 INFO L168 Benchmark]: CDTParser took 0.12 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-18 09:55:18,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -96.8 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,823 INFO L168 Benchmark]: Boogie Preprocessor took 52.86 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,823 INFO L168 Benchmark]: RCFGBuilder took 779.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 958.6 MB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,824 INFO L168 Benchmark]: TraceAbstraction took 13497.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 958.6 MB in the beginning and 891.7 MB in the end (delta: 66.9 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:18,824 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 891.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:55:18,826 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.12 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 897.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -96.8 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.86 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 779.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 958.6 MB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13497.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 958.6 MB in the beginning and 891.7 MB in the end (delta: 66.9 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 891.7 MB. 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 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 20487 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; [L1043] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20489, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20493:0}] [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] FCALL s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] FCALL s->session = malloc(sizeof(SSL_SESSION)) [L1072] FCALL s->state = 12292 [L1073] FCALL s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20484:0}, SSLv3_client_data={20493: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 () [L1105] FCALL s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] FCALL *tmp___0 = 0 [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->info_callback={9:14}, skip=0, SSLv3_client_data={20493:0}, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR, FCALL s->info_callback [L1112] cb = s->info_callback [L1120] EXPR, FCALL s->in_handshake [L1120] FCALL s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=12292, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] FCALL s->new_session = 1 [L1238] FCALL s->state = 4096 [L1239] EXPR, FCALL s->ctx [L1239] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate [L1239] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] FCALL s->server = 0 VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1250] EXPR, FCALL s->version VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->version=1, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] FCALL s->type = 4096 [L1257] EXPR, FCALL s->init_buf VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, 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) [L1283] FCALL s->state = 4368 [L1284] EXPR, FCALL s->ctx [L1284] EXPR, FCALL (s->ctx)->stats.sess_connect [L1284] FCALL (s->ctx)->stats.sess_connect += 1 [L1285] FCALL s->init_num = 0 VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={9:14}, blastFlag=0, buf={20491:20495}, init=1, ret=-1, s={20484:0}, s={20484:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] FCALL s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) [L1301] FCALL s->state = 4384 [L1302] FCALL s->init_num = 0 [L1303] EXPR, FCALL s->bbio [L1303] EXPR, FCALL s->wbio VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->bbio={1:2}, s->wbio={1:1}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, 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 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={9:14}, blastFlag=1, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) [L1322] FCALL s->hit VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->hit=0, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] FCALL s->state = 4400 VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] FCALL s->init_num = 0 VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={9:14}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR, FCALL s->s3 [L1331] EXPR, FCALL (s->s3)->tmp.new_cipher [L1331] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={9:14}, ((s->s3)->tmp.new_cipher)->algorithms=20482, (s->s3)->tmp.new_cipher={20486:1}, blastFlag=2, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->state = 4416 [L1347] FCALL s->init_num = 0 VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR, FCALL s->state VAL [={9:14}, blastFlag=3, buf={20491:20495}, init=1, ret=10, s={20484:0}, s={20484:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) [L1362] FCALL s->state = 4432 [L1363] FCALL s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=5, s={20484:0}, s={20484:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] FCALL s->state = 4448 [L1386] FCALL s->init_num = 0 VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 [L1605] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:14}, (s->s3)->tmp.reuse_message=20494, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->s3={20481:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=6, s={20484:0}, s={20484:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, 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 [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1646] __VERIFIER_error() VAL [={9:14}, blastFlag=4, buf={20491:20495}, init=1, ret=1, s={20484:0}, s={20484:0}, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=1, tmp___0={20484:92}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 13.4s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7748 SDtfs, 3101 SDslu, 10374 SDs, 0 SdLazy, 5853 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 72 SyntacticMatches, 47 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 2781 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3501 NumberOfCodeBlocks, 3501 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3315 ConstructedInterpolants, 0 QuantifiedInterpolants, 806323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 3338/3338 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-5842f4b [2018-11-18 09:55:20,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:55:20,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:55:20,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:55:20,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:55:20,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:55:20,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:55:20,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:55:20,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:55:20,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:55:20,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:55:20,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:55:20,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:55:20,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:55:20,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:55:20,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:55:20,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:55:20,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:55:20,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:55:20,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:55:20,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:55:20,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:55:20,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:55:20,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:55:20,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:55:20,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:55:20,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:55:20,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:55:20,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:55:20,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:55:20,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:55:20,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:55:20,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:55:20,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:55:20,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:55:20,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:55:20,254 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 09:55:20,265 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:55:20,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:55:20,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:55:20,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:55:20,266 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:55:20,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:55:20,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:55:20,268 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 09:55:20,268 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 09:55:20,269 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:55:20,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:55:20,269 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:55:20,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:55:20,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:55:20,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 09:55:20,270 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 09:55:20,270 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_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan 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 -> Taipan 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-18 09:55:20,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:55:20,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:55:20,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:55:20,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:55:20,316 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:55:20,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:20,361 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/c9e9cb83a/713c74251ba448e0b2a6605b59efc256/FLAG17692bf3a [2018-11-18 09:55:20,746 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:55:20,747 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:20,758 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/c9e9cb83a/713c74251ba448e0b2a6605b59efc256/FLAG17692bf3a [2018-11-18 09:55:21,123 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/data/c9e9cb83a/713c74251ba448e0b2a6605b59efc256 [2018-11-18 09:55:21,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:55:21,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:55:21,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:55:21,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:55:21,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:55:21,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cb878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21, skipping insertion in model container [2018-11-18 09:55:21,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:55:21,173 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:55:21,626 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:55:21,639 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:55:21,889 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:55:21,903 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:55:21,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21 WrapperNode [2018-11-18 09:55:21,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:55:21,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:55:21,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:55:21,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:55:21,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:55:21,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:55:21,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:55:21,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:55:21,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... [2018-11-18 09:55:21,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:55:21,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:55:21,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:55:21,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:55:21,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:55:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:55:22,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:55:22,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 09:55:22,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 09:55:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:55:22,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:55:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 09:55:24,275 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:55:24,276 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:55:24,830 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:55:24,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:24 BoogieIcfgContainer [2018-11-18 09:55:24,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:55:24,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:55:24,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:55:24,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:55:24,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:55:21" (1/3) ... [2018-11-18 09:55:24,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575dcfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:24, skipping insertion in model container [2018-11-18 09:55:24,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:55:21" (2/3) ... [2018-11-18 09:55:24,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575dcfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:55:24, skipping insertion in model container [2018-11-18 09:55:24,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:24" (3/3) ... [2018-11-18 09:55:24,837 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-18 09:55:24,845 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:55:24,852 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:55:24,861 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:55:24,881 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:55:24,882 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:55:24,882 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:55:24,882 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:55:24,882 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:55:24,882 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:55:24,882 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:55:24,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:55:24,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:55:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-18 09:55:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 09:55:24,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:24,900 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] [2018-11-18 09:55:24,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:24,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -244527418, now seen corresponding path program 1 times [2018-11-18 09:55:24,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:24,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:25,045 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-18 09:55:25,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:25,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:25,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:25,067 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-18 09:55:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:25,159 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-18 09:55:25,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:25,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 09:55:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:25,171 INFO L225 Difference]: With dead ends: 388 [2018-11-18 09:55:25,171 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 09:55:25,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-18 09:55:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 09:55:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-18 09:55:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 09:55:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-18 09:55:25,215 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-18 09:55:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:25,216 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-18 09:55:25,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-18 09:55:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 09:55:25,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:25,218 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:25,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:25,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:25,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1281881606, now seen corresponding path program 1 times [2018-11-18 09:55:25,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:55:25,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:25,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:25,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:25,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:25,355 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-18 09:55:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:25,445 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-18 09:55:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:25,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 09:55:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:25,448 INFO L225 Difference]: With dead ends: 436 [2018-11-18 09:55:25,448 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 09:55:25,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-18 09:55:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 09:55:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-18 09:55:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 09:55:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-18 09:55:25,469 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-18 09:55:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:25,469 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-18 09:55:25,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-18 09:55:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 09:55:25,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:25,471 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:55:25,471 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:25,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash 854628109, now seen corresponding path program 1 times [2018-11-18 09:55:25,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:25,480 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:25,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:55:25,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:25,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:25,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:25,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:25,589 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-11-18 09:55:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:25,647 INFO L93 Difference]: Finished difference Result 644 states and 949 transitions. [2018-11-18 09:55:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:25,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 09:55:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:25,650 INFO L225 Difference]: With dead ends: 644 [2018-11-18 09:55:25,650 INFO L226 Difference]: Without dead ends: 433 [2018-11-18 09:55:25,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-18 09:55:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-18 09:55:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-11-18 09:55:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-18 09:55:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 632 transitions. [2018-11-18 09:55:25,669 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 632 transitions. Word has length 66 [2018-11-18 09:55:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:25,670 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 632 transitions. [2018-11-18 09:55:25,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 632 transitions. [2018-11-18 09:55:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 09:55:25,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:25,674 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:25,674 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:25,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1955490482, now seen corresponding path program 1 times [2018-11-18 09:55:25,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:25,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:55:25,793 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:25,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:25,796 INFO L87 Difference]: Start difference. First operand 433 states and 632 transitions. Second operand 3 states. [2018-11-18 09:55:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:25,873 INFO L93 Difference]: Finished difference Result 853 states and 1254 transitions. [2018-11-18 09:55:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:25,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-18 09:55:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:25,875 INFO L225 Difference]: With dead ends: 853 [2018-11-18 09:55:25,875 INFO L226 Difference]: Without dead ends: 537 [2018-11-18 09:55:25,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 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-18 09:55:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-18 09:55:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-11-18 09:55:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-18 09:55:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 784 transitions. [2018-11-18 09:55:25,890 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 784 transitions. Word has length 87 [2018-11-18 09:55:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:25,891 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 784 transitions. [2018-11-18 09:55:25,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 784 transitions. [2018-11-18 09:55:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 09:55:25,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:25,892 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:25,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:25,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -728147403, now seen corresponding path program 1 times [2018-11-18 09:55:25,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:25,893 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:25,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:26,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:26,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:55:26,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:55:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:55:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:55:26,008 INFO L87 Difference]: Start difference. First operand 537 states and 784 transitions. Second operand 3 states. [2018-11-18 09:55:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:26,059 INFO L93 Difference]: Finished difference Result 954 states and 1396 transitions. [2018-11-18 09:55:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:55:26,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-18 09:55:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:26,062 INFO L225 Difference]: With dead ends: 954 [2018-11-18 09:55:26,062 INFO L226 Difference]: Without dead ends: 534 [2018-11-18 09:55:26,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-18 09:55:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-18 09:55:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-11-18 09:55:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-18 09:55:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 774 transitions. [2018-11-18 09:55:26,077 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 774 transitions. Word has length 109 [2018-11-18 09:55:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:26,078 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 774 transitions. [2018-11-18 09:55:26,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:55:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 774 transitions. [2018-11-18 09:55:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 09:55:26,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:26,079 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:26,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:26,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 188803088, now seen corresponding path program 1 times [2018-11-18 09:55:26,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:26,081 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:26,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:26,499 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 18 treesize of output 15 [2018-11-18 09:55:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:55:26,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:26,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:26,513 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-18 09:55:26,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-18 09:55:26,607 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-18 09:55:26,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:26,613 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-18 09:55:26,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:26,620 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-18 09:55:26,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 09:55:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:26,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:26,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:55:26,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:55:26,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:55:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:55:26,654 INFO L87 Difference]: Start difference. First operand 534 states and 774 transitions. Second operand 7 states. [2018-11-18 09:55:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:27,755 INFO L93 Difference]: Finished difference Result 1425 states and 2074 transitions. [2018-11-18 09:55:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:55:27,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-18 09:55:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:27,759 INFO L225 Difference]: With dead ends: 1425 [2018-11-18 09:55:27,759 INFO L226 Difference]: Without dead ends: 904 [2018-11-18 09:55:27,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:55:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-18 09:55:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 642. [2018-11-18 09:55:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-18 09:55:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 962 transitions. [2018-11-18 09:55:27,779 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 962 transitions. Word has length 111 [2018-11-18 09:55:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:27,779 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 962 transitions. [2018-11-18 09:55:27,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:55:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 962 transitions. [2018-11-18 09:55:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 09:55:27,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:27,780 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:27,781 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:27,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1553451324, now seen corresponding path program 1 times [2018-11-18 09:55:27,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:27,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:28,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:28,185 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 18 treesize of output 15 [2018-11-18 09:55:28,188 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:55:28,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:28,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:28,194 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-18 09:55:28,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-18 09:55:28,239 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-18 09:55:28,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:28,242 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-18 09:55:28,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:28,247 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-18 09:55:28,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 09:55:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 09:55:28,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:28,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:55:28,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:55:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:55:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:55:28,268 INFO L87 Difference]: Start difference. First operand 642 states and 962 transitions. Second operand 7 states. [2018-11-18 09:55:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:31,412 INFO L93 Difference]: Finished difference Result 1517 states and 2240 transitions. [2018-11-18 09:55:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:55:31,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-11-18 09:55:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:31,417 INFO L225 Difference]: With dead ends: 1517 [2018-11-18 09:55:31,417 INFO L226 Difference]: Without dead ends: 888 [2018-11-18 09:55:31,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:55:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-18 09:55:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 646. [2018-11-18 09:55:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 09:55:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 966 transitions. [2018-11-18 09:55:31,449 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 966 transitions. Word has length 112 [2018-11-18 09:55:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:31,450 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 966 transitions. [2018-11-18 09:55:31,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:55:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 966 transitions. [2018-11-18 09:55:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:31,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:31,452 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:31,452 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:31,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1778299933, now seen corresponding path program 1 times [2018-11-18 09:55:31,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:31,453 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:31,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:31,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 09:55:31,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:31,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:31,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 09:55:31,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:31,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,000 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 23 treesize of output 20 [2018-11-18 09:55:32,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-18 09:55:32,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 09:55:32,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,030 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-18 09:55:32,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,088 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:38, output treesize:30 [2018-11-18 09:55:32,461 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-11-18 09:55:32,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,559 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 130 [2018-11-18 09:55:32,565 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-18 09:55:32,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,624 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 93 [2018-11-18 09:55:32,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 30 [2018-11-18 09:55:32,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,651 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-18 09:55:32,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,658 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-18 09:55:32,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,702 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 15 [2018-11-18 09:55:32,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-18 09:55:32,706 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,707 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,715 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:193, output treesize:22 [2018-11-18 09:55:32,738 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-18 09:55:32,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:32,745 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-18 09:55:32,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,749 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-18 09:55:32,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 09:55:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 09:55:32,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:55:32,867 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:32,867 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:95, output treesize:1 [2018-11-18 09:55:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 09:55:32,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:55:32,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 09:55:32,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:55:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:55:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:55:32,881 INFO L87 Difference]: Start difference. First operand 646 states and 966 transitions. Second operand 9 states. [2018-11-18 09:55:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:43,464 INFO L93 Difference]: Finished difference Result 3287 states and 4885 transitions. [2018-11-18 09:55:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:55:43,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-18 09:55:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:43,473 INFO L225 Difference]: With dead ends: 3287 [2018-11-18 09:55:43,473 INFO L226 Difference]: Without dead ends: 2654 [2018-11-18 09:55:43,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:55:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2018-11-18 09:55:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 796. [2018-11-18 09:55:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-11-18 09:55:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1216 transitions. [2018-11-18 09:55:43,527 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1216 transitions. Word has length 127 [2018-11-18 09:55:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:43,528 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 1216 transitions. [2018-11-18 09:55:43,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:55:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1216 transitions. [2018-11-18 09:55:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 09:55:43,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:43,530 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:43,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:43,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash 702799817, now seen corresponding path program 1 times [2018-11-18 09:55:43,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:43,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:43,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:43,927 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 09:55:43,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:43,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:43,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-18 09:55:43,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:43,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:43,995 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 23 treesize of output 20 [2018-11-18 09:55:43,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-18 09:55:44,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 09:55:44,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,011 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-18 09:55:44,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,061 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:38, output treesize:30 [2018-11-18 09:55:44,277 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-11-18 09:55:44,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,337 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 130 [2018-11-18 09:55:44,342 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-18 09:55:44,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,403 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 93 [2018-11-18 09:55:44,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 30 [2018-11-18 09:55:44,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,426 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-18 09:55:44,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,432 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-18 09:55:44,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,473 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 15 [2018-11-18 09:55:44,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-18 09:55:44,475 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,485 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:193, output treesize:22 [2018-11-18 09:55:44,511 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-18 09:55:44,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:44,513 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-18 09:55:44,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,518 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-18 09:55:44,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 09:55:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 09:55:44,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:55:44,645 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:44,645 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:93, output treesize:1 [2018-11-18 09:55:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 09:55:44,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:55:44,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 09:55:44,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:55:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:55:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:55:44,658 INFO L87 Difference]: Start difference. First operand 796 states and 1216 transitions. Second operand 9 states. [2018-11-18 09:55:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:55,557 INFO L93 Difference]: Finished difference Result 3687 states and 5577 transitions. [2018-11-18 09:55:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:55:55,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2018-11-18 09:55:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:55,566 INFO L225 Difference]: With dead ends: 3687 [2018-11-18 09:55:55,566 INFO L226 Difference]: Without dead ends: 2904 [2018-11-18 09:55:55,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:55:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2018-11-18 09:55:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 824. [2018-11-18 09:55:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-11-18 09:55:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1269 transitions. [2018-11-18 09:55:55,627 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1269 transitions. Word has length 128 [2018-11-18 09:55:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:55,628 INFO L480 AbstractCegarLoop]: Abstraction has 824 states and 1269 transitions. [2018-11-18 09:55:55,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:55:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1269 transitions. [2018-11-18 09:55:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 09:55:55,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:55,630 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:55,630 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:55,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -40450807, now seen corresponding path program 1 times [2018-11-18 09:55:55,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:56,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:56,036 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-18 09:55:56,041 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-18 09:55:56,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 09:55:56,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-18 09:55:56,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:56,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:56,091 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-18 09:55:56,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 09:55:56,129 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-18 09:55:56,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:56,140 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-18 09:55:56,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:56,144 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-18 09:55:56,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 09:55:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 09:55:56,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:55:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:55:56,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 09:55:56,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:55:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:55:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:55:56,164 INFO L87 Difference]: Start difference. First operand 824 states and 1269 transitions. Second operand 8 states. [2018-11-18 09:55:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:55:59,128 INFO L93 Difference]: Finished difference Result 1997 states and 3047 transitions. [2018-11-18 09:55:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:55:59,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2018-11-18 09:55:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:55:59,132 INFO L225 Difference]: With dead ends: 1997 [2018-11-18 09:55:59,132 INFO L226 Difference]: Without dead ends: 1186 [2018-11-18 09:55:59,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:55:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2018-11-18 09:55:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 912. [2018-11-18 09:55:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-18 09:55:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1413 transitions. [2018-11-18 09:55:59,173 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1413 transitions. Word has length 134 [2018-11-18 09:55:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:55:59,174 INFO L480 AbstractCegarLoop]: Abstraction has 912 states and 1413 transitions. [2018-11-18 09:55:59,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:55:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1413 transitions. [2018-11-18 09:55:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 09:55:59,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:55:59,175 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:55:59,176 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:55:59,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:55:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -923959797, now seen corresponding path program 1 times [2018-11-18 09:55:59,176 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:55:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:55:59,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:55:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:59,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:55:59,754 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 09:55:59,762 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 09:55:59,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-18 09:55:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:59,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 38 [2018-11-18 09:55:59,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,815 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 30 treesize of output 26 [2018-11-18 09:55:59,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:59,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:59,844 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 4 case distinctions, treesize of input 23 treesize of output 46 [2018-11-18 09:55:59,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-18 09:55:59,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:55:59,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:55:59,926 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 09:55:59,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:55:59,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:55:59,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 [2018-11-18 09:55:59,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,946 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,972 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 30 treesize of output 31 [2018-11-18 09:55:59,975 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 8 treesize of output 7 [2018-11-18 09:55:59,975 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,983 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:55:59,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 09:56:00,037 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:45, output treesize:56 [2018-11-18 09:56:00,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,140 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2018-11-18 09:56:00,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-11-18 09:56:00,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,264 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2018-11-18 09:56:00,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 09:56:00,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:56:00,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,449 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 34 treesize of output 41 [2018-11-18 09:56:00,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:00,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-18 09:56:00,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,475 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-18 09:56:00,518 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:92 [2018-11-18 09:56:00,720 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 15 treesize of output 11 [2018-11-18 09:56:00,721 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 11 treesize of output 3 [2018-11-18 09:56:00,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:00,724 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-18 09:56:00,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 09:56:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-18 09:56:00,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:56:00,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:00,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 09:56:00,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:56:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:56:00,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:56:00,750 INFO L87 Difference]: Start difference. First operand 912 states and 1413 transitions. Second operand 9 states. [2018-11-18 09:56:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:12,107 INFO L93 Difference]: Finished difference Result 1710 states and 2642 transitions. [2018-11-18 09:56:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:56:12,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-18 09:56:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:12,109 INFO L225 Difference]: With dead ends: 1710 [2018-11-18 09:56:12,109 INFO L226 Difference]: Without dead ends: 993 [2018-11-18 09:56:12,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:56:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-18 09:56:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 921. [2018-11-18 09:56:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-18 09:56:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1427 transitions. [2018-11-18 09:56:12,139 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1427 transitions. Word has length 134 [2018-11-18 09:56:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:12,140 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1427 transitions. [2018-11-18 09:56:12,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:56:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1427 transitions. [2018-11-18 09:56:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 09:56:12,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:12,141 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:12,141 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:12,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:12,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1318978943, now seen corresponding path program 1 times [2018-11-18 09:56:12,142 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:12,142 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:56:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:56:12,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:56:12,643 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 09:56:12,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:56:12,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 [2018-11-18 09:56:12,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,682 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 30 treesize of output 31 [2018-11-18 09:56:12,685 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 8 treesize of output 7 [2018-11-18 09:56:12,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,708 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 09:56:12,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-18 09:56:12,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 38 [2018-11-18 09:56:12,723 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,759 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 30 treesize of output 26 [2018-11-18 09:56:12,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,794 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 4 case distinctions, treesize of input 23 treesize of output 46 [2018-11-18 09:56:12,794 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-18 09:56:12,826 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:56:12,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:56:12,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-18 09:56:12,891 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:45, output treesize:76 [2018-11-18 09:56:12,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,944 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 34 treesize of output 41 [2018-11-18 09:56:12,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:12,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-18 09:56:12,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:12,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:13,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,037 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2018-11-18 09:56:13,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-11-18 09:56:13,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:13,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:56:13,119 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 80 [2018-11-18 09:56:13,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-18 09:56:13,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:56:13,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-18 09:56:13,213 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:88 [2018-11-18 09:56:13,401 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 15 treesize of output 11 [2018-11-18 09:56:13,402 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 11 treesize of output 3 [2018-11-18 09:56:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:56:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:56:13,405 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-18 09:56:13,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 09:56:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-18 09:56:13,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:56:13,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:56:13,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 09:56:13,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:56:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:56:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:56:13,443 INFO L87 Difference]: Start difference. First operand 921 states and 1427 transitions. Second operand 9 states. [2018-11-18 09:56:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:56:24,822 INFO L93 Difference]: Finished difference Result 1707 states and 2638 transitions. [2018-11-18 09:56:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:56:24,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-18 09:56:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:56:24,824 INFO L225 Difference]: With dead ends: 1707 [2018-11-18 09:56:24,824 INFO L226 Difference]: Without dead ends: 990 [2018-11-18 09:56:24,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:56:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-11-18 09:56:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 922. [2018-11-18 09:56:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-11-18 09:56:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1428 transitions. [2018-11-18 09:56:24,876 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1428 transitions. Word has length 135 [2018-11-18 09:56:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:56:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 922 states and 1428 transitions. [2018-11-18 09:56:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:56:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1428 transitions. [2018-11-18 09:56:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 09:56:24,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:56:24,879 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:56:24,879 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:56:24,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:56:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1323914216, now seen corresponding path program 1 times [2018-11-18 09:56:24,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:56:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/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-18 09:56:24,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:56:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:56:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:56:26,289 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:56:26,338 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-18 09:56:26,339 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-18 09:56:26,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:56:26 BoogieIcfgContainer [2018-11-18 09:56:26,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:56:26,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:56:26,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:56:26,391 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:56:26,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:55:24" (3/4) ... [2018-11-18 09:56:26,395 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:56:26,414 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-18 09:56:26,414 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-18 09:56:26,494 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5da2fae9-3996-470c-8ef1-b8bc96befe70/bin-2019/utaipan/witness.graphml [2018-11-18 09:56:26,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:56:26,495 INFO L168 Benchmark]: Toolchain (without parser) took 65369.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -251.1 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:26,496 INFO L168 Benchmark]: CDTParser took 0.14 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-18 09:56:26,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -115.2 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:26,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:56:26,496 INFO L168 Benchmark]: Boogie Preprocessor took 58.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:26,497 INFO L168 Benchmark]: RCFGBuilder took 2839.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.1 MB in the end (delta: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:26,497 INFO L168 Benchmark]: TraceAbstraction took 61559.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 960.1 MB in the beginning and 1.2 GB in the end (delta: -255.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:56:26,497 INFO L168 Benchmark]: Witness Printer took 103.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:56:26,498 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.14 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 776.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -115.2 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2839.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.1 MB in the end (delta: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61559.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 960.1 MB in the beginning and 1.2 GB in the end (delta: -255.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 103.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. 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)# * 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; [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={-2048916867:0}] [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] FCALL s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] FCALL s->session = malloc(sizeof(SSL_SESSION)) [L1072] FCALL s->state = 12292 [L1073] FCALL s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={-202887464:0}, SSLv3_client_data={-2048916867: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 () [L1105] FCALL s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] FCALL *tmp___0 = 0 [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={-2048916867:0}, tmp=0, tmp___0={-1211625764: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 [L1112] cb = s->info_callback [L1120] EXPR, FCALL s->in_handshake [L1120] FCALL s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, s->state=12292, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] FCALL s->new_session = 1 [L1238] FCALL s->state = 4096 [L1239] EXPR, FCALL s->ctx [L1239] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate [L1239] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] FCALL s->server = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->version=768, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] FCALL s->type = 4096 [L1257] EXPR, FCALL s->init_buf VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, s->init_buf={1:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764: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) [L1283] FCALL s->state = 4368 [L1284] EXPR, FCALL s->ctx [L1284] EXPR, FCALL (s->ctx)->stats.sess_connect [L1284] FCALL (s->ctx)->stats.sess_connect += 1 [L1285] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=12292, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4368, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] FCALL s->shutdown = 0 [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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) [L1301] FCALL s->state = 4384 [L1302] FCALL s->init_num = 0 [L1303] EXPR, FCALL s->bbio [L1303] EXPR, FCALL s->wbio VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->bbio={0:0}, s->wbio={1:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4368, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4384, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) [L1322] FCALL s->hit VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->hit=0, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4384, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4400, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR, FCALL s->s3 [L1331] EXPR, FCALL (s->s3)->tmp.new_cipher [L1331] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={-202887464:52}, blastFlag=2, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->state = 4416 [L1347] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR, FCALL s->s3 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4400, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4416, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) [L1362] FCALL s->state = 4432 [L1363] FCALL s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4416, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4432, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] FCALL s->state = 4448 [L1386] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR, FCALL s->s3 [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={-202887464:0}, s={-202887464:0}, s->s3={-1211625764:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4432, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR, FCALL s->state [L1133] state = s->state [L1134] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, ret=1073741824, s={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, s->state=4448, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764: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={-202887464:0}, s={-202887464:0}, skip=0, SSLv3_client_data={-2048916867:0}, state=4448, tmp=0, tmp___0={-1211625764:52}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 61.5s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 51.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2559 SDtfs, 4590 SDslu, 4933 SDs, 0 SdLazy, 4427 SolverSat, 464 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 49.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1502 GetRequests, 1421 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 4856 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1462 ConstructedInterpolants, 14 QuantifiedInterpolants, 1291086 SizeOfPredicates, 68 NumberOfNonLiveVariables, 3086 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1628/1756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...