./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/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 1420a5dac3676d838e2b742b3a84faa6df74a9e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/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 1420a5dac3676d838e2b742b3a84faa6df74a9e1 ................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:56:20,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:56:20,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:56:20,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:56:20,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:56:20,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:56:20,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:56:20,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:56:20,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:56:20,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:56:20,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:56:20,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:56:20,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:56:20,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:56:20,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:56:20,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:56:20,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:56:20,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:56:20,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:56:20,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:56:20,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:56:20,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:56:20,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:56:20,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:56:20,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:56:20,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:56:20,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:56:20,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:56:20,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:56:20,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:56:20,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:56:20,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:56:20,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:56:20,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:56:20,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:56:20,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:56:20,576 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 18:56:20,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:56:20,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:56:20,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:56:20,584 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:56:20,584 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:56:20,584 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:56:20,584 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:56:20,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:56:20,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:56:20,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:56:20,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:56:20,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:56:20,587 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 18:56:20,587 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_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/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 -> 1420a5dac3676d838e2b742b3a84faa6df74a9e1 [2018-12-09 18:56:20,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:56:20,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:56:20,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:56:20,618 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:56:20,618 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:56:20,618 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2018-12-09 18:56:20,660 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/360918d1c/a0986a7c5b624144adedaf4f2d6a87a0/FLAGfa9e4bd71 [2018-12-09 18:56:21,015 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:56:21,015 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2018-12-09 18:56:21,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/360918d1c/a0986a7c5b624144adedaf4f2d6a87a0/FLAGfa9e4bd71 [2018-12-09 18:56:21,397 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/360918d1c/a0986a7c5b624144adedaf4f2d6a87a0 [2018-12-09 18:56:21,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:56:21,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:56:21,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:56:21,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:56:21,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:56:21,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21, skipping insertion in model container [2018-12-09 18:56:21,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:56:21,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:56:21,740 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:56:21,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:56:21,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:56:21,811 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:56:21,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21 WrapperNode [2018-12-09 18:56:21,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:56:21,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:56:21,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:56:21,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:56:21,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:56:21,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:56:21,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:56:21,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:56:21,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... [2018-12-09 18:56:21,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:56:21,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:56:21,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:56:21,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:56:21,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/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-12-09 18:56:21,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 18:56:21,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:56:21,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:56:21,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 18:56:21,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 18:56:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:56:21,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:56:22,078 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 18:56:22,079 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 18:56:22,411 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:56:22,411 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 18:56:22,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:56:22 BoogieIcfgContainer [2018-12-09 18:56:22,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:56:22,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:56:22,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:56:22,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:56:22,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:56:21" (1/3) ... [2018-12-09 18:56:22,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c6948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:56:22, skipping insertion in model container [2018-12-09 18:56:22,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:21" (2/3) ... [2018-12-09 18:56:22,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c6948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:56:22, skipping insertion in model container [2018-12-09 18:56:22,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:56:22" (3/3) ... [2018-12-09 18:56:22,417 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03_false-unreach-call.i.cil.c [2018-12-09 18:56:22,423 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:56:22,428 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 18:56:22,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 18:56:22,455 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:56:22,455 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 18:56:22,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:56:22,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:56:22,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:56:22,455 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:56:22,456 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:56:22,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:56:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-12-09 18:56:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 18:56:22,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:22,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:22,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:22,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 500880985, now seen corresponding path program 1 times [2018-12-09 18:56:22,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:22,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:22,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:22,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:22,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:22,652 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2018-12-09 18:56:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:22,706 INFO L93 Difference]: Finished difference Result 379 states and 634 transitions. [2018-12-09 18:56:22,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:22,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 18:56:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:22,715 INFO L225 Difference]: With dead ends: 379 [2018-12-09 18:56:22,715 INFO L226 Difference]: Without dead ends: 219 [2018-12-09 18:56:22,718 INFO L631 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-12-09 18:56:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-09 18:56:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-09 18:56:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-09 18:56:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2018-12-09 18:56:22,753 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2018-12-09 18:56:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2018-12-09 18:56:22,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2018-12-09 18:56:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 18:56:22,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:22,755 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:22,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1966298573, now seen corresponding path program 1 times [2018-12-09 18:56:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:22,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:22,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:22,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:22,823 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2018-12-09 18:56:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:22,860 INFO L93 Difference]: Finished difference Result 423 states and 632 transitions. [2018-12-09 18:56:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:22,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 18:56:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:22,862 INFO L225 Difference]: With dead ends: 423 [2018-12-09 18:56:22,863 INFO L226 Difference]: Without dead ends: 318 [2018-12-09 18:56:22,863 INFO L631 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-12-09 18:56:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-09 18:56:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-09 18:56:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-09 18:56:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2018-12-09 18:56:22,877 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2018-12-09 18:56:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:22,877 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2018-12-09 18:56:22,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2018-12-09 18:56:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:56:22,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:22,879 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:22,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:22,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash 4919250, now seen corresponding path program 1 times [2018-12-09 18:56:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:22,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:22,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:22,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:22,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:22,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:22,958 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2018-12-09 18:56:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:23,266 INFO L93 Difference]: Finished difference Result 809 states and 1200 transitions. [2018-12-09 18:56:23,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:23,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:56:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:23,268 INFO L225 Difference]: With dead ends: 809 [2018-12-09 18:56:23,268 INFO L226 Difference]: Without dead ends: 504 [2018-12-09 18:56:23,269 INFO L631 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-12-09 18:56:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-12-09 18:56:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2018-12-09 18:56:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-09 18:56:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2018-12-09 18:56:23,282 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2018-12-09 18:56:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:23,282 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2018-12-09 18:56:23,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2018-12-09 18:56:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:56:23,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:23,284 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:23,284 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:23,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash -129094256, now seen corresponding path program 1 times [2018-12-09 18:56:23,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:23,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:23,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:23,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:23,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:23,337 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2018-12-09 18:56:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:23,541 INFO L93 Difference]: Finished difference Result 809 states and 1221 transitions. [2018-12-09 18:56:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:23,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:56:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:23,543 INFO L225 Difference]: With dead ends: 809 [2018-12-09 18:56:23,543 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:23,544 INFO L631 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-12-09 18:56:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2018-12-09 18:56:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-09 18:56:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2018-12-09 18:56:23,555 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2018-12-09 18:56:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:23,556 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2018-12-09 18:56:23,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2018-12-09 18:56:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 18:56:23,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:23,558 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:23,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:23,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash 147810951, now seen corresponding path program 1 times [2018-12-09 18:56:23,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:23,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:23,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:23,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:23,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:23,610 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2018-12-09 18:56:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:23,869 INFO L93 Difference]: Finished difference Result 931 states and 1412 transitions. [2018-12-09 18:56:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:23,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 18:56:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:23,872 INFO L225 Difference]: With dead ends: 931 [2018-12-09 18:56:23,872 INFO L226 Difference]: Without dead ends: 536 [2018-12-09 18:56:23,873 INFO L631 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-12-09 18:56:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-09 18:56:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2018-12-09 18:56:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2018-12-09 18:56:23,885 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2018-12-09 18:56:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:23,886 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2018-12-09 18:56:23,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2018-12-09 18:56:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:56:23,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:23,887 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:23,887 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:23,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash 765836586, now seen corresponding path program 1 times [2018-12-09 18:56:23,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:23,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:23,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:23,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:23,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:23,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:23,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:23,945 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2018-12-09 18:56:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:24,194 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2018-12-09 18:56:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:24,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:56:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:24,195 INFO L225 Difference]: With dead ends: 931 [2018-12-09 18:56:24,196 INFO L226 Difference]: Without dead ends: 534 [2018-12-09 18:56:24,196 INFO L631 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-12-09 18:56:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-09 18:56:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2018-12-09 18:56:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2018-12-09 18:56:24,203 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2018-12-09 18:56:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:24,203 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2018-12-09 18:56:24,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2018-12-09 18:56:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:56:24,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:24,204 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:24,204 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:24,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash -343143860, now seen corresponding path program 1 times [2018-12-09 18:56:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:24,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:24,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:24,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:24,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:24,242 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2018-12-09 18:56:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:24,488 INFO L93 Difference]: Finished difference Result 931 states and 1406 transitions. [2018-12-09 18:56:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:24,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:56:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:24,489 INFO L225 Difference]: With dead ends: 931 [2018-12-09 18:56:24,489 INFO L226 Difference]: Without dead ends: 534 [2018-12-09 18:56:24,490 INFO L631 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-12-09 18:56:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-09 18:56:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2018-12-09 18:56:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2018-12-09 18:56:24,497 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2018-12-09 18:56:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:24,497 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2018-12-09 18:56:24,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2018-12-09 18:56:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:56:24,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:24,498 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:24,498 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:24,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -263522712, now seen corresponding path program 1 times [2018-12-09 18:56:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:24,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:24,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:24,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:24,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:24,545 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2018-12-09 18:56:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:24,704 INFO L93 Difference]: Finished difference Result 851 states and 1281 transitions. [2018-12-09 18:56:24,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:24,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:56:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:24,706 INFO L225 Difference]: With dead ends: 851 [2018-12-09 18:56:24,706 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:24,706 INFO L631 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-12-09 18:56:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2018-12-09 18:56:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2018-12-09 18:56:24,713 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2018-12-09 18:56:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:24,713 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2018-12-09 18:56:24,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2018-12-09 18:56:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 18:56:24,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:24,714 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:24,714 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:24,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1372503158, now seen corresponding path program 1 times [2018-12-09 18:56:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:24,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:24,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:24,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:24,751 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2018-12-09 18:56:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:24,930 INFO L93 Difference]: Finished difference Result 851 states and 1277 transitions. [2018-12-09 18:56:24,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:24,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 18:56:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:24,932 INFO L225 Difference]: With dead ends: 851 [2018-12-09 18:56:24,932 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:24,933 INFO L631 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-12-09 18:56:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2018-12-09 18:56:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2018-12-09 18:56:24,945 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2018-12-09 18:56:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:24,946 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2018-12-09 18:56:24,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2018-12-09 18:56:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:56:24,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:24,947 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:24,947 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:24,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1993132031, now seen corresponding path program 1 times [2018-12-09 18:56:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:24,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:24,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:24,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:24,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:24,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:24,987 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2018-12-09 18:56:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:25,241 INFO L93 Difference]: Finished difference Result 931 states and 1394 transitions. [2018-12-09 18:56:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:25,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:56:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:25,242 INFO L225 Difference]: With dead ends: 931 [2018-12-09 18:56:25,242 INFO L226 Difference]: Without dead ends: 534 [2018-12-09 18:56:25,243 INFO L631 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-12-09 18:56:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-09 18:56:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2018-12-09 18:56:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2018-12-09 18:56:25,251 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2018-12-09 18:56:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:25,251 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2018-12-09 18:56:25,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-12-09 18:56:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:56:25,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:25,252 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:25,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:25,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1693070948, now seen corresponding path program 1 times [2018-12-09 18:56:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:25,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:25,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:25,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:25,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:25,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:25,285 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2018-12-09 18:56:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:25,542 INFO L93 Difference]: Finished difference Result 786 states and 1171 transitions. [2018-12-09 18:56:25,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:25,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:56:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:25,544 INFO L225 Difference]: With dead ends: 786 [2018-12-09 18:56:25,545 INFO L226 Difference]: Without dead ends: 534 [2018-12-09 18:56:25,545 INFO L631 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-12-09 18:56:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-09 18:56:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2018-12-09 18:56:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2018-12-09 18:56:25,557 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2018-12-09 18:56:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:25,557 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2018-12-09 18:56:25,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2018-12-09 18:56:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:56:25,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:25,559 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:25,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:25,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 456468099, now seen corresponding path program 1 times [2018-12-09 18:56:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:25,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:25,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:25,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:25,602 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2018-12-09 18:56:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:25,785 INFO L93 Difference]: Finished difference Result 851 states and 1265 transitions. [2018-12-09 18:56:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:25,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:56:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:25,787 INFO L225 Difference]: With dead ends: 851 [2018-12-09 18:56:25,787 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:25,788 INFO L631 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-12-09 18:56:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2018-12-09 18:56:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2018-12-09 18:56:25,802 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2018-12-09 18:56:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:25,802 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2018-12-09 18:56:25,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2018-12-09 18:56:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:56:25,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:25,804 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:25,804 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:25,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash 756529182, now seen corresponding path program 1 times [2018-12-09 18:56:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:25,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:25,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:25,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:25,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:25,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:25,865 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2018-12-09 18:56:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:26,034 INFO L93 Difference]: Finished difference Result 706 states and 1044 transitions. [2018-12-09 18:56:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:26,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 18:56:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:26,035 INFO L225 Difference]: With dead ends: 706 [2018-12-09 18:56:26,035 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:26,036 INFO L631 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-12-09 18:56:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2018-12-09 18:56:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2018-12-09 18:56:26,043 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2018-12-09 18:56:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:26,044 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2018-12-09 18:56:26,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2018-12-09 18:56:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:56:26,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:26,045 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:26,045 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:26,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1546577145, now seen corresponding path program 1 times [2018-12-09 18:56:26,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:26,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:26,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:26,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:26,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:26,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:26,083 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2018-12-09 18:56:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:26,340 INFO L93 Difference]: Finished difference Result 931 states and 1378 transitions. [2018-12-09 18:56:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:26,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:56:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:26,343 INFO L225 Difference]: With dead ends: 931 [2018-12-09 18:56:26,343 INFO L226 Difference]: Without dead ends: 534 [2018-12-09 18:56:26,344 INFO L631 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-12-09 18:56:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-09 18:56:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2018-12-09 18:56:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2018-12-09 18:56:26,355 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2018-12-09 18:56:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:26,356 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2018-12-09 18:56:26,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2018-12-09 18:56:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:56:26,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:26,357 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:26,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1458412487, now seen corresponding path program 1 times [2018-12-09 18:56:26,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:26,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:26,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:26,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:26,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:26,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:26,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:26,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:26,409 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2018-12-09 18:56:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:26,641 INFO L93 Difference]: Finished difference Result 780 states and 1152 transitions. [2018-12-09 18:56:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:26,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:56:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:26,643 INFO L225 Difference]: With dead ends: 780 [2018-12-09 18:56:26,643 INFO L226 Difference]: Without dead ends: 528 [2018-12-09 18:56:26,643 INFO L631 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-12-09 18:56:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-09 18:56:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2018-12-09 18:56:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2018-12-09 18:56:26,651 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2018-12-09 18:56:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:26,651 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2018-12-09 18:56:26,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2018-12-09 18:56:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:56:26,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:26,652 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:26,652 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:26,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1376582853, now seen corresponding path program 1 times [2018-12-09 18:56:26,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:26,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:26,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:26,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:26,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:26,686 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2018-12-09 18:56:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:26,837 INFO L93 Difference]: Finished difference Result 851 states and 1249 transitions. [2018-12-09 18:56:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:26,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:56:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:26,838 INFO L225 Difference]: With dead ends: 851 [2018-12-09 18:56:26,838 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 18:56:26,839 INFO L631 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-12-09 18:56:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 18:56:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2018-12-09 18:56:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2018-12-09 18:56:26,850 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2018-12-09 18:56:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:26,850 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2018-12-09 18:56:26,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2018-12-09 18:56:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 18:56:26,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:26,851 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:26,851 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:26,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 86605189, now seen corresponding path program 1 times [2018-12-09 18:56:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:26,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:26,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:26,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:26,898 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2018-12-09 18:56:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,071 INFO L93 Difference]: Finished difference Result 700 states and 1025 transitions. [2018-12-09 18:56:27,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:27,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 18:56:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,073 INFO L225 Difference]: With dead ends: 700 [2018-12-09 18:56:27,073 INFO L226 Difference]: Without dead ends: 448 [2018-12-09 18:56:27,074 INFO L631 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-12-09 18:56:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-12-09 18:56:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2018-12-09 18:56:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2018-12-09 18:56:27,081 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2018-12-09 18:56:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,081 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2018-12-09 18:56:27,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2018-12-09 18:56:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:56:27,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,082 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:27,082 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash -531696932, now seen corresponding path program 1 times [2018-12-09 18:56:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:27,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:27,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:27,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:27,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:27,128 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2018-12-09 18:56:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,342 INFO L93 Difference]: Finished difference Result 907 states and 1333 transitions. [2018-12-09 18:56:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:27,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:56:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,344 INFO L225 Difference]: With dead ends: 907 [2018-12-09 18:56:27,344 INFO L226 Difference]: Without dead ends: 510 [2018-12-09 18:56:27,345 INFO L631 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-12-09 18:56:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-09 18:56:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2018-12-09 18:56:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2018-12-09 18:56:27,352 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2018-12-09 18:56:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,352 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2018-12-09 18:56:27,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2018-12-09 18:56:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 18:56:27,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,353 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:27,353 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -108050210, now seen corresponding path program 1 times [2018-12-09 18:56:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:27,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:27,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:27,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:27,396 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2018-12-09 18:56:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,543 INFO L93 Difference]: Finished difference Result 827 states and 1208 transitions. [2018-12-09 18:56:27,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:27,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 18:56:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,544 INFO L225 Difference]: With dead ends: 827 [2018-12-09 18:56:27,545 INFO L226 Difference]: Without dead ends: 430 [2018-12-09 18:56:27,545 INFO L631 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-12-09 18:56:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-12-09 18:56:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2018-12-09 18:56:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2018-12-09 18:56:27,556 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2018-12-09 18:56:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,556 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2018-12-09 18:56:27,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2018-12-09 18:56:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:27,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,557 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:27,557 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash -260577949, now seen corresponding path program 1 times [2018-12-09 18:56:27,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 18:56:27,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:27,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:27,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:27,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:27,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:27,612 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2018-12-09 18:56:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,817 INFO L93 Difference]: Finished difference Result 907 states and 1325 transitions. [2018-12-09 18:56:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:27,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 18:56:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,818 INFO L225 Difference]: With dead ends: 907 [2018-12-09 18:56:27,818 INFO L226 Difference]: Without dead ends: 510 [2018-12-09 18:56:27,818 INFO L631 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-12-09 18:56:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-09 18:56:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2018-12-09 18:56:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-09 18:56:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2018-12-09 18:56:27,830 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2018-12-09 18:56:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,830 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2018-12-09 18:56:27,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2018-12-09 18:56:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:27,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,831 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:27,831 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -12431455, now seen corresponding path program 1 times [2018-12-09 18:56:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 18:56:27,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:27,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:27,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:27,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:27,872 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2018-12-09 18:56:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,914 INFO L93 Difference]: Finished difference Result 809 states and 1182 transitions. [2018-12-09 18:56:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:27,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 18:56:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,915 INFO L225 Difference]: With dead ends: 809 [2018-12-09 18:56:27,916 INFO L226 Difference]: Without dead ends: 559 [2018-12-09 18:56:27,916 INFO L631 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-12-09 18:56:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-12-09 18:56:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-12-09 18:56:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-12-09 18:56:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2018-12-09 18:56:27,925 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2018-12-09 18:56:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,925 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2018-12-09 18:56:27,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2018-12-09 18:56:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 18:56:27,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,926 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:27,927 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash -427077033, now seen corresponding path program 1 times [2018-12-09 18:56:27,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 18:56:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:27,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:27,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:27,950 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2018-12-09 18:56:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,973 INFO L93 Difference]: Finished difference Result 1107 states and 1616 transitions. [2018-12-09 18:56:27,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:27,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-09 18:56:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:27,976 INFO L225 Difference]: With dead ends: 1107 [2018-12-09 18:56:27,976 INFO L226 Difference]: Without dead ends: 708 [2018-12-09 18:56:27,976 INFO L631 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-12-09 18:56:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-09 18:56:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-12-09 18:56:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-12-09 18:56:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2018-12-09 18:56:27,992 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2018-12-09 18:56:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:27,992 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2018-12-09 18:56:27,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2018-12-09 18:56:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 18:56:27,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:27,994 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 18:56:27,994 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:27,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1175788506, now seen corresponding path program 1 times [2018-12-09 18:56:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:27,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 18:56:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:28,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:28,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:28,080 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 6 states. [2018-12-09 18:56:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:28,363 INFO L93 Difference]: Finished difference Result 1341 states and 1956 transitions. [2018-12-09 18:56:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:56:28,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-09 18:56:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:28,365 INFO L225 Difference]: With dead ends: 1341 [2018-12-09 18:56:28,365 INFO L226 Difference]: Without dead ends: 791 [2018-12-09 18:56:28,365 INFO L631 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-12-09 18:56:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-12-09 18:56:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 716. [2018-12-09 18:56:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-12-09 18:56:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1043 transitions. [2018-12-09 18:56:28,377 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1043 transitions. Word has length 104 [2018-12-09 18:56:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:28,377 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 1043 transitions. [2018-12-09 18:56:28,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1043 transitions. [2018-12-09 18:56:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 18:56:28,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:28,379 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:28,379 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:28,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash 953389165, now seen corresponding path program 1 times [2018-12-09 18:56:28,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:28,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 18:56:28,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:28,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:28,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:28,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:28,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:28,452 INFO L87 Difference]: Start difference. First operand 716 states and 1043 transitions. Second operand 6 states. [2018-12-09 18:56:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:28,751 INFO L93 Difference]: Finished difference Result 1338 states and 1952 transitions. [2018-12-09 18:56:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:56:28,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-09 18:56:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:28,753 INFO L225 Difference]: With dead ends: 1338 [2018-12-09 18:56:28,753 INFO L226 Difference]: Without dead ends: 788 [2018-12-09 18:56:28,754 INFO L631 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-12-09 18:56:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-12-09 18:56:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 717. [2018-12-09 18:56:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-12-09 18:56:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2018-12-09 18:56:28,764 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 105 [2018-12-09 18:56:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:28,765 INFO L480 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2018-12-09 18:56:28,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2018-12-09 18:56:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 18:56:28,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:28,766 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 18:56:28,766 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:28,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2127944510, now seen corresponding path program 1 times [2018-12-09 18:56:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:28,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:56:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:56:28,947 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 18:56:28,978 WARN L1298 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-12-09 18:56:28,979 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20486 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-12-09 18:56:29,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:56:29 BoogieIcfgContainer [2018-12-09 18:56:29,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:56:29,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:56:29,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:56:29,012 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:56:29,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:56:22" (3/4) ... [2018-12-09 18:56:29,015 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 18:56:29,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:56:29,015 INFO L168 Benchmark]: Toolchain (without parser) took 7614.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -56.4 MB). Peak memory consumption was 165.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:29,016 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:56:29,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:29,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:56:29,017 INFO L168 Benchmark]: Boogie Preprocessor took 43.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:29,017 INFO L168 Benchmark]: RCFGBuilder took 534.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:29,018 INFO L168 Benchmark]: TraceAbstraction took 6598.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:29,018 INFO L168 Benchmark]: Witness Printer took 3.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:56:29,020 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 534.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6598.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 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 20486 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: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1338. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20533, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20492:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20498:0}, SSLv3_client_data={20492:0}] [L1080] BUF_MEM *buf ; [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 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=12292, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->version=0, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->init_buf={2:-1}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->hit=0, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] s->init_num = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20529, (s->s3)->tmp.new_cipher={20511:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, init=1, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={1:0}, blastFlag=4, init=1, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5114 SDtfs, 2296 SDslu, 6858 SDs, 0 SdLazy, 4107 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 48 SyntacticMatches, 36 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=24, 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 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-635dfa2 [2018-12-09 18:56:30,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:56:30,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:56:30,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:56:30,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:56:30,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:56:30,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:56:30,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:56:30,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:56:30,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:56:30,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:56:30,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:56:30,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:56:30,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:56:30,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:56:30,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:56:30,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:56:30,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:56:30,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:56:30,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:56:30,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:56:30,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:56:30,343 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:56:30,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:56:30,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:56:30,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:56:30,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:56:30,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:56:30,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:56:30,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:56:30,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:56:30,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:56:30,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:56:30,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:56:30,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:56:30,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:56:30,347 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 18:56:30,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:56:30,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:56:30,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:56:30,355 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:56:30,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:56:30,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:56:30,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:56:30,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:56:30,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:56:30,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 18:56:30,358 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 18:56:30,358 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_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/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 -> 1420a5dac3676d838e2b742b3a84faa6df74a9e1 [2018-12-09 18:56:30,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:56:30,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:56:30,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:56:30,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:56:30,391 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:56:30,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2018-12-09 18:56:30,437 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/acab9b5b5/63b098e151404b84aeb476430445e95e/FLAG606ead8c1 [2018-12-09 18:56:30,880 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:56:30,881 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/sv-benchmarks/c/ssh/s3_clnt.blast.03_false-unreach-call.i.cil.c [2018-12-09 18:56:30,891 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/acab9b5b5/63b098e151404b84aeb476430445e95e/FLAG606ead8c1 [2018-12-09 18:56:30,899 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2d3a121-3ed5-4a5d-bd3a-6318f6def8e7/bin-2019/utaipan/data/acab9b5b5/63b098e151404b84aeb476430445e95e [2018-12-09 18:56:30,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:56:30,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:56:30,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:56:30,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:56:30,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:56:30,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:56:30" (1/1) ... [2018-12-09 18:56:30,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4fc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:56:30, skipping insertion in model container [2018-12-09 18:56:30,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:56:30" (1/1) ... [2018-12-09 18:56:30,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:56:30,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:56:31,148 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:56:31,160 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:56:31,256 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:56:31,257 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 18:56:31,259 INFO L168 Benchmark]: Toolchain (without parser) took 358.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:31,260 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:56:31,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:31,262 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...