./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_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_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/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 69033ce18a9d55d3b643fc421e26bf1667e81629 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/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 69033ce18a9d55d3b643fc421e26bf1667e81629 ....................................................................................................................................................................... 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-08 15:10:11,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:10:11,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:10:11,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:10:11,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:10:11,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:10:11,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:10:11,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:10:11,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:10:11,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:10:11,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:10:11,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:10:11,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:10:11,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:10:11,788 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:10:11,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:10:11,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:10:11,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:10:11,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:10:11,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:10:11,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:10:11,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:10:11,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:10:11,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:10:11,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:10:11,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:10:11,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:10:11,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:10:11,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:10:11,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:10:11,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:10:11,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:10:11,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:10:11,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:10:11,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:10:11,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:10:11,797 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 15:10:11,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:10:11,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:10:11,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:10:11,805 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:10:11,805 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:10:11,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:10:11,805 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:10:11,805 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:10:11,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:10:11,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:10:11,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:10:11,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:10:11,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:10:11,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 15:10:11,808 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_28b69648-881a-42bb-af26-67c723c3de4e/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 -> 69033ce18a9d55d3b643fc421e26bf1667e81629 [2018-12-08 15:10:11,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:10:11,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:10:11,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:10:11,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:10:11,839 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:10:11,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-12-08 15:10:11,880 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/23cbf548b/53cfd51bb33f4dff9e47bace3865706f/FLAGfd297b7b6 [2018-12-08 15:10:12,319 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:10:12,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-12-08 15:10:12,328 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/23cbf548b/53cfd51bb33f4dff9e47bace3865706f/FLAGfd297b7b6 [2018-12-08 15:10:12,336 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/23cbf548b/53cfd51bb33f4dff9e47bace3865706f [2018-12-08 15:10:12,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:10:12,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:10:12,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:10:12,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:10:12,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:10:12,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca4a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12, skipping insertion in model container [2018-12-08 15:10:12,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:10:12,374 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:10:12,609 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:10:12,618 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:10:12,673 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:10:12,684 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:10:12,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12 WrapperNode [2018-12-08 15:10:12,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:10:12,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:10:12,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:10:12,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:10:12,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:10:12,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:10:12,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:10:12,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:10:12,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... [2018-12-08 15:10:12,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:10:12,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:10:12,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:10:12,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:10:12,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/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-08 15:10:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 15:10:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:10:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:10:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:10:12,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-08 15:10:12,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-08 15:10:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:10:12,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:10:12,916 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 15:10:12,917 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 15:10:13,268 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:10:13,269 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 15:10:13,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:10:13 BoogieIcfgContainer [2018-12-08 15:10:13,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:10:13,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:10:13,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:10:13,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:10:13,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:10:12" (1/3) ... [2018-12-08 15:10:13,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a4a6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:10:13, skipping insertion in model container [2018-12-08 15:10:13,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:10:12" (2/3) ... [2018-12-08 15:10:13,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a4a6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:10:13, skipping insertion in model container [2018-12-08 15:10:13,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:10:13" (3/3) ... [2018-12-08 15:10:13,273 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-12-08 15:10:13,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:10:13,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 15:10:13,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 15:10:13,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:10:13,311 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 15:10:13,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:10:13,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:10:13,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:10:13,311 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:10:13,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:10:13,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:10:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-12-08 15:10:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 15:10:13,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:13,326 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-08 15:10:13,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:13,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 500880985, now seen corresponding path program 1 times [2018-12-08 15:10:13,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:13,484 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-08 15:10:13,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:13,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:10:13,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:10:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:10:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:10:13,498 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2018-12-08 15:10:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:13,556 INFO L93 Difference]: Finished difference Result 378 states and 632 transitions. [2018-12-08 15:10:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:10:13,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 15:10:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:13,565 INFO L225 Difference]: With dead ends: 378 [2018-12-08 15:10:13,565 INFO L226 Difference]: Without dead ends: 218 [2018-12-08 15:10:13,567 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-08 15:10:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-08 15:10:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-08 15:10:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-08 15:10:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2018-12-08 15:10:13,601 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2018-12-08 15:10:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:13,601 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2018-12-08 15:10:13,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:10:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2018-12-08 15:10:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 15:10:13,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:13,602 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-08 15:10:13,602 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:13,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash -372477229, now seen corresponding path program 1 times [2018-12-08 15:10:13,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:13,666 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-08 15:10:13,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:13,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:10:13,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:13,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:10:13,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:10:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:10:13,668 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand 3 states. [2018-12-08 15:10:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:13,701 INFO L93 Difference]: Finished difference Result 423 states and 633 transitions. [2018-12-08 15:10:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:10:13,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 15:10:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:13,703 INFO L225 Difference]: With dead ends: 423 [2018-12-08 15:10:13,703 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 15:10:13,704 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-08 15:10:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 15:10:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-08 15:10:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-08 15:10:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2018-12-08 15:10:13,717 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2018-12-08 15:10:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:13,717 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2018-12-08 15:10:13,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:10:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2018-12-08 15:10:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 15:10:13,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:13,719 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-08 15:10:13,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:13,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 205120466, now seen corresponding path program 1 times [2018-12-08 15:10:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:13,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:13,792 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-08 15:10:13,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:13,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:13,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:13,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:13,793 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2018-12-08 15:10:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:14,116 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2018-12-08 15:10:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:14,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 15:10:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:14,118 INFO L225 Difference]: With dead ends: 808 [2018-12-08 15:10:14,119 INFO L226 Difference]: Without dead ends: 503 [2018-12-08 15:10:14,120 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-08 15:10:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-12-08 15:10:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2018-12-08 15:10:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-08 15:10:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2018-12-08 15:10:14,132 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2018-12-08 15:10:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:14,133 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2018-12-08 15:10:14,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2018-12-08 15:10:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 15:10:14,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:14,135 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-08 15:10:14,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:14,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 71106960, now seen corresponding path program 1 times [2018-12-08 15:10:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:14,188 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-08 15:10:14,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:14,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:14,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:14,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:14,189 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2018-12-08 15:10:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:14,379 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2018-12-08 15:10:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:14,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 15:10:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:14,381 INFO L225 Difference]: With dead ends: 808 [2018-12-08 15:10:14,381 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:14,382 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-08 15:10:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 408. [2018-12-08 15:10:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-08 15:10:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2018-12-08 15:10:14,397 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2018-12-08 15:10:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2018-12-08 15:10:14,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2018-12-08 15:10:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 15:10:14,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:14,400 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-08 15:10:14,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:14,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2059081351, now seen corresponding path program 1 times [2018-12-08 15:10:14,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:14,469 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-08 15:10:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:14,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:14,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:14,471 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2018-12-08 15:10:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:14,756 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2018-12-08 15:10:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:14,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 15:10:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:14,758 INFO L225 Difference]: With dead ends: 930 [2018-12-08 15:10:14,758 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 15:10:14,759 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-08 15:10:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 15:10:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2018-12-08 15:10:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2018-12-08 15:10:14,766 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2018-12-08 15:10:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:14,767 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2018-12-08 15:10:14,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2018-12-08 15:10:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 15:10:14,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:14,768 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-08 15:10:14,768 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:14,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:14,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1964085546, now seen corresponding path program 1 times [2018-12-08 15:10:14,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:14,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:14,811 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-08 15:10:14,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:14,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:14,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:14,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:14,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:14,812 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2018-12-08 15:10:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:15,071 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2018-12-08 15:10:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:15,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 15:10:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:15,073 INFO L225 Difference]: With dead ends: 930 [2018-12-08 15:10:15,074 INFO L226 Difference]: Without dead ends: 533 [2018-12-08 15:10:15,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-08 15:10:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-08 15:10:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-08 15:10:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2018-12-08 15:10:15,082 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2018-12-08 15:10:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:15,082 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2018-12-08 15:10:15,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2018-12-08 15:10:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 15:10:15,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:15,083 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-08 15:10:15,083 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:15,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 855105100, now seen corresponding path program 1 times [2018-12-08 15:10:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:15,128 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-08 15:10:15,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:15,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:15,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:15,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:15,130 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2018-12-08 15:10:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:15,404 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2018-12-08 15:10:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:15,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 15:10:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:15,406 INFO L225 Difference]: With dead ends: 930 [2018-12-08 15:10:15,406 INFO L226 Difference]: Without dead ends: 533 [2018-12-08 15:10:15,407 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-08 15:10:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-08 15:10:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-08 15:10:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2018-12-08 15:10:15,415 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2018-12-08 15:10:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:15,415 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2018-12-08 15:10:15,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2018-12-08 15:10:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 15:10:15,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:15,416 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-08 15:10:15,417 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 934726248, now seen corresponding path program 1 times [2018-12-08 15:10:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:15,454 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-08 15:10:15,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:15,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:15,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:15,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:15,455 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2018-12-08 15:10:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:15,627 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2018-12-08 15:10:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:15,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 15:10:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:15,629 INFO L225 Difference]: With dead ends: 850 [2018-12-08 15:10:15,629 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:15,630 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-08 15:10:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-08 15:10:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2018-12-08 15:10:15,637 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2018-12-08 15:10:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:15,637 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2018-12-08 15:10:15,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2018-12-08 15:10:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 15:10:15,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:15,638 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-08 15:10:15,639 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:15,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash -174254198, now seen corresponding path program 1 times [2018-12-08 15:10:15,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:15,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:15,691 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-08 15:10:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:15,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:15,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:15,692 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2018-12-08 15:10:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:15,871 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2018-12-08 15:10:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:15,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 15:10:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:15,872 INFO L225 Difference]: With dead ends: 850 [2018-12-08 15:10:15,872 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:15,873 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-08 15:10:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-08 15:10:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2018-12-08 15:10:15,879 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2018-12-08 15:10:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:15,880 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2018-12-08 15:10:15,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2018-12-08 15:10:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 15:10:15,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:15,880 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-08 15:10:15,881 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:15,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 792847361, now seen corresponding path program 1 times [2018-12-08 15:10:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:15,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:15,916 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-08 15:10:15,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:15,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:15,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:15,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:15,917 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2018-12-08 15:10:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:16,187 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2018-12-08 15:10:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:16,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 15:10:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:16,189 INFO L225 Difference]: With dead ends: 930 [2018-12-08 15:10:16,189 INFO L226 Difference]: Without dead ends: 533 [2018-12-08 15:10:16,189 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-08 15:10:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-08 15:10:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-08 15:10:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2018-12-08 15:10:16,198 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2018-12-08 15:10:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:16,198 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2018-12-08 15:10:16,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-12-08 15:10:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 15:10:16,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:16,199 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-08 15:10:16,199 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:16,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1052519805, now seen corresponding path program 1 times [2018-12-08 15:10:16,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:16,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:16,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:16,239 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-08 15:10:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:16,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:16,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:16,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:16,240 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2018-12-08 15:10:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:16,448 INFO L93 Difference]: Finished difference Result 850 states and 1268 transitions. [2018-12-08 15:10:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:16,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 15:10:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:16,450 INFO L225 Difference]: With dead ends: 850 [2018-12-08 15:10:16,450 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:16,451 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-08 15:10:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-08 15:10:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2018-12-08 15:10:16,463 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2018-12-08 15:10:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:16,463 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2018-12-08 15:10:16,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2018-12-08 15:10:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 15:10:16,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:16,465 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-08 15:10:16,465 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:16,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1080561913, now seen corresponding path program 1 times [2018-12-08 15:10:16,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:16,504 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-08 15:10:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:16,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:16,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:16,505 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2018-12-08 15:10:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:16,738 INFO L93 Difference]: Finished difference Result 930 states and 1385 transitions. [2018-12-08 15:10:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:16,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 15:10:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:16,740 INFO L225 Difference]: With dead ends: 930 [2018-12-08 15:10:16,740 INFO L226 Difference]: Without dead ends: 533 [2018-12-08 15:10:16,741 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-08 15:10:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-08 15:10:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-08 15:10:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2018-12-08 15:10:16,748 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 79 [2018-12-08 15:10:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:16,748 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2018-12-08 15:10:16,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2018-12-08 15:10:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 15:10:16,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:16,748 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, 1] [2018-12-08 15:10:16,749 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:16,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash 793698234, now seen corresponding path program 1 times [2018-12-08 15:10:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:16,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:16,782 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-08 15:10:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:16,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:16,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:16,783 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2018-12-08 15:10:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:17,034 INFO L93 Difference]: Finished difference Result 786 states and 1165 transitions. [2018-12-08 15:10:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:17,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 15:10:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:17,036 INFO L225 Difference]: With dead ends: 786 [2018-12-08 15:10:17,036 INFO L226 Difference]: Without dead ends: 533 [2018-12-08 15:10:17,037 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-08 15:10:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-08 15:10:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2018-12-08 15:10:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2018-12-08 15:10:17,044 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 79 [2018-12-08 15:10:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:17,044 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2018-12-08 15:10:17,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2018-12-08 15:10:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 15:10:17,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:17,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-08 15:10:17,045 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:17,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1842598085, now seen corresponding path program 1 times [2018-12-08 15:10:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:17,077 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-08 15:10:17,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:17,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:17,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:17,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:17,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:17,078 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2018-12-08 15:10:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:17,224 INFO L93 Difference]: Finished difference Result 850 states and 1256 transitions. [2018-12-08 15:10:17,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:17,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 15:10:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:17,225 INFO L225 Difference]: With dead ends: 850 [2018-12-08 15:10:17,225 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:17,226 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-08 15:10:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-08 15:10:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2018-12-08 15:10:17,238 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2018-12-08 15:10:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:17,238 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2018-12-08 15:10:17,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2018-12-08 15:10:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 15:10:17,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:17,240 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, 1] [2018-12-08 15:10:17,240 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -578109064, now seen corresponding path program 1 times [2018-12-08 15:10:17,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:17,287 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-08 15:10:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:17,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:17,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:17,289 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2018-12-08 15:10:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:17,452 INFO L93 Difference]: Finished difference Result 706 states and 1038 transitions. [2018-12-08 15:10:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:17,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 15:10:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:17,453 INFO L225 Difference]: With dead ends: 706 [2018-12-08 15:10:17,453 INFO L226 Difference]: Without dead ends: 453 [2018-12-08 15:10:17,454 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-08 15:10:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-08 15:10:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2018-12-08 15:10:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2018-12-08 15:10:17,461 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2018-12-08 15:10:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:17,462 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2018-12-08 15:10:17,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2018-12-08 15:10:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 15:10:17,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:17,463 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-08 15:10:17,463 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:17,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1029873372, now seen corresponding path program 1 times [2018-12-08 15:10:17,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:17,500 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-08 15:10:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:17,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:17,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:17,501 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2018-12-08 15:10:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:17,734 INFO L93 Difference]: Finished difference Result 912 states and 1347 transitions. [2018-12-08 15:10:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:17,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 15:10:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:17,735 INFO L225 Difference]: With dead ends: 912 [2018-12-08 15:10:17,735 INFO L226 Difference]: Without dead ends: 515 [2018-12-08 15:10:17,736 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-08 15:10:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-08 15:10:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 410. [2018-12-08 15:10:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2018-12-08 15:10:17,743 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 80 [2018-12-08 15:10:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:17,743 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2018-12-08 15:10:17,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2018-12-08 15:10:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 15:10:17,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:17,744 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, 1] [2018-12-08 15:10:17,744 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:17,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash 800991983, now seen corresponding path program 1 times [2018-12-08 15:10:17,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:17,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:17,780 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-08 15:10:17,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:17,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:17,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:17,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:17,781 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2018-12-08 15:10:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,040 INFO L93 Difference]: Finished difference Result 761 states and 1122 transitions. [2018-12-08 15:10:18,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:18,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 15:10:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,042 INFO L225 Difference]: With dead ends: 761 [2018-12-08 15:10:18,042 INFO L226 Difference]: Without dead ends: 508 [2018-12-08 15:10:18,042 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-08 15:10:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-12-08 15:10:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 410. [2018-12-08 15:10:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2018-12-08 15:10:18,050 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 80 [2018-12-08 15:10:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,051 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2018-12-08 15:10:18,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2018-12-08 15:10:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 15:10:18,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,052 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-08 15:10:18,052 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1453520094, now seen corresponding path program 1 times [2018-12-08 15:10:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,101 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-08 15:10:18,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:18,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:18,102 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2018-12-08 15:10:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,256 INFO L93 Difference]: Finished difference Result 832 states and 1218 transitions. [2018-12-08 15:10:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:18,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 15:10:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,257 INFO L225 Difference]: With dead ends: 832 [2018-12-08 15:10:18,257 INFO L226 Difference]: Without dead ends: 435 [2018-12-08 15:10:18,258 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-08 15:10:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-08 15:10:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 410. [2018-12-08 15:10:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2018-12-08 15:10:18,274 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2018-12-08 15:10:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,274 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2018-12-08 15:10:18,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2018-12-08 15:10:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 15:10:18,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,276 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, 1] [2018-12-08 15:10:18,276 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1224638705, now seen corresponding path program 1 times [2018-12-08 15:10:18,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,317 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-08 15:10:18,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:18,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:18,318 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2018-12-08 15:10:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,433 INFO L93 Difference]: Finished difference Result 681 states and 995 transitions. [2018-12-08 15:10:18,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:18,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 15:10:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,435 INFO L225 Difference]: With dead ends: 681 [2018-12-08 15:10:18,435 INFO L226 Difference]: Without dead ends: 428 [2018-12-08 15:10:18,435 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-08 15:10:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-08 15:10:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 410. [2018-12-08 15:10:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2018-12-08 15:10:18,446 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2018-12-08 15:10:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,446 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2018-12-08 15:10:18,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2018-12-08 15:10:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 15:10:18,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,447 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-08 15:10:18,447 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash 903461219, now seen corresponding path program 1 times [2018-12-08 15:10:18,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,493 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-08 15:10:18,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:10:18,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:10:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:10:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:10:18,494 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2018-12-08 15:10:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,721 INFO L93 Difference]: Finished difference Result 905 states and 1322 transitions. [2018-12-08 15:10:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:10:18,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 15:10:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,723 INFO L225 Difference]: With dead ends: 905 [2018-12-08 15:10:18,723 INFO L226 Difference]: Without dead ends: 508 [2018-12-08 15:10:18,723 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-08 15:10:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-12-08 15:10:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 410. [2018-12-08 15:10:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 15:10:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2018-12-08 15:10:18,730 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2018-12-08 15:10:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,730 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2018-12-08 15:10:18,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:10:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2018-12-08 15:10:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 15:10:18,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,731 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-08 15:10:18,731 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1151607713, now seen corresponding path program 1 times [2018-12-08 15:10:18,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,757 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-08 15:10:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:10:18,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:10:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:10:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:10:18,759 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2018-12-08 15:10:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,789 INFO L93 Difference]: Finished difference Result 810 states and 1183 transitions. [2018-12-08 15:10:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:10:18,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-08 15:10:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,791 INFO L225 Difference]: With dead ends: 810 [2018-12-08 15:10:18,791 INFO L226 Difference]: Without dead ends: 559 [2018-12-08 15:10:18,792 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-08 15:10:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-12-08 15:10:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-12-08 15:10:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-12-08 15:10:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2018-12-08 15:10:18,805 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2018-12-08 15:10:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,805 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2018-12-08 15:10:18,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:10:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2018-12-08 15:10:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 15:10:18,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,806 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-08 15:10:18,807 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1523066455, now seen corresponding path program 1 times [2018-12-08 15:10:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,832 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-08 15:10:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:10:18,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:10:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:10:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:10:18,832 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2018-12-08 15:10:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:18,864 INFO L93 Difference]: Finished difference Result 1108 states and 1617 transitions. [2018-12-08 15:10:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:10:18,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-08 15:10:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:18,867 INFO L225 Difference]: With dead ends: 1108 [2018-12-08 15:10:18,867 INFO L226 Difference]: Without dead ends: 708 [2018-12-08 15:10:18,867 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-08 15:10:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-08 15:10:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-12-08 15:10:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-12-08 15:10:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2018-12-08 15:10:18,883 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2018-12-08 15:10:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:18,883 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2018-12-08 15:10:18,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:10:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2018-12-08 15:10:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 15:10:18,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:18,884 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-08 15:10:18,884 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:18,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1102745638, now seen corresponding path program 1 times [2018-12-08 15:10:18,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:18,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:18,990 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-08 15:10:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:18,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:10:18,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:18,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:10:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:10:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:10:18,991 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 6 states. [2018-12-08 15:10:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:19,256 INFO L93 Difference]: Finished difference Result 1341 states and 1956 transitions. [2018-12-08 15:10:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:10:19,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 15:10:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:19,257 INFO L225 Difference]: With dead ends: 1341 [2018-12-08 15:10:19,257 INFO L226 Difference]: Without dead ends: 790 [2018-12-08 15:10:19,258 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-08 15:10:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-08 15:10:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 716. [2018-12-08 15:10:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-12-08 15:10:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1043 transitions. [2018-12-08 15:10:19,270 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1043 transitions. Word has length 104 [2018-12-08 15:10:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:19,270 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 1043 transitions. [2018-12-08 15:10:19,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:10:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1043 transitions. [2018-12-08 15:10:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 15:10:19,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:19,271 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-08 15:10:19,271 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:19,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1063043987, now seen corresponding path program 1 times [2018-12-08 15:10:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:19,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:19,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:10:19,343 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-08 15:10:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:10:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:10:19,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:10:19,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:10:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:10:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:10:19,344 INFO L87 Difference]: Start difference. First operand 716 states and 1043 transitions. Second operand 6 states. [2018-12-08 15:10:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:10:19,663 INFO L93 Difference]: Finished difference Result 1338 states and 1952 transitions. [2018-12-08 15:10:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:10:19,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-08 15:10:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:10:19,665 INFO L225 Difference]: With dead ends: 1338 [2018-12-08 15:10:19,665 INFO L226 Difference]: Without dead ends: 787 [2018-12-08 15:10:19,666 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-08 15:10:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-12-08 15:10:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 717. [2018-12-08 15:10:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-12-08 15:10:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2018-12-08 15:10:19,676 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 105 [2018-12-08 15:10:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:10:19,676 INFO L480 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2018-12-08 15:10:19,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:10:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2018-12-08 15:10:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 15:10:19,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:10:19,678 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-08 15:10:19,678 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:10:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:10:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 111511358, now seen corresponding path program 1 times [2018-12-08 15:10:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:10:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:10:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:10:19,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:10:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:10:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:10:19,910 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 15:10:19,948 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-08 15:10:19,949 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-08 15:10:19,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:10:19 BoogieIcfgContainer [2018-12-08 15:10:19,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 15:10:19,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:10:19,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:10:19,994 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:10:19,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:10:13" (3/4) ... [2018-12-08 15:10:19,997 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 15:10:19,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:10:19,997 INFO L168 Benchmark]: Toolchain (without parser) took 7658.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 949.6 MB in the beginning and 1.3 GB in the end (delta: -376.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:19,998 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:10:19,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:19,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:10:19,999 INFO L168 Benchmark]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:19,999 INFO L168 Benchmark]: RCFGBuilder took 515.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:19,999 INFO L168 Benchmark]: TraceAbstraction took 6724.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:10:20,000 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:10:20,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6724.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 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)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] 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] [L1310] 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 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] 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.6s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5101 SDtfs, 2194 SDslu, 6935 SDs, 0 SdLazy, 4180 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s 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, 1623 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 398815 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-08 15:10:21,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:10:21,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:10:21,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:10:21,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:10:21,320 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:10:21,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:10:21,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:10:21,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:10:21,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:10:21,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:10:21,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:10:21,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:10:21,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:10:21,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:10:21,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:10:21,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:10:21,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:10:21,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:10:21,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:10:21,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:10:21,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:10:21,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:10:21,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:10:21,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:10:21,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:10:21,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:10:21,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:10:21,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:10:21,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:10:21,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:10:21,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:10:21,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:10:21,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:10:21,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:10:21,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:10:21,340 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 15:10:21,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:10:21,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:10:21,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:10:21,351 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:10:21,351 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:10:21,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:10:21,351 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:10:21,352 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:10:21,352 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:10:21,352 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:10:21,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:10:21,352 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 15:10:21,353 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:10:21,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:10:21,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:10:21,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:10:21,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:10:21,355 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 15:10:21,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:10:21,355 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 15:10:21,355 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 15:10:21,355 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_28b69648-881a-42bb-af26-67c723c3de4e/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 -> 69033ce18a9d55d3b643fc421e26bf1667e81629 [2018-12-08 15:10:21,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:10:21,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:10:21,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:10:21,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:10:21,391 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:10:21,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-12-08 15:10:21,435 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/e2ba219e4/37c1c4044f44432190422e0588016153/FLAG4e33f621c [2018-12-08 15:10:21,792 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:10:21,792 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/sv-benchmarks/c/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-12-08 15:10:21,800 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/e2ba219e4/37c1c4044f44432190422e0588016153/FLAG4e33f621c [2018-12-08 15:10:21,808 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28b69648-881a-42bb-af26-67c723c3de4e/bin-2019/utaipan/data/e2ba219e4/37c1c4044f44432190422e0588016153 [2018-12-08 15:10:21,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:10:21,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:10:21,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:10:21,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:10:21,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:10:21,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:10:21" (1/1) ... [2018-12-08 15:10:21,817 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 08.12 03:10:21, skipping insertion in model container [2018-12-08 15:10:21,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:10:21" (1/1) ... [2018-12-08 15:10:21,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:10:21,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:10:22,087 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:10:22,102 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:10:22,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:10:22,214 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-08 15:10:22,217 INFO L168 Benchmark]: Toolchain (without parser) took 406.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:22,219 INFO L168 Benchmark]: CDTParser took 0.16 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-08 15:10:22,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-08 15:10:22,221 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.16 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 404.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 40.6 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...