./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b ................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 20:58:47,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:58:47,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:58:47,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:58:47,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:58:47,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:58:47,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:58:47,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:58:47,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:58:47,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:58:47,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:58:47,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:58:47,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:58:47,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:58:47,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:58:47,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:58:47,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:58:47,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:58:47,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:58:47,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:58:47,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:58:47,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:58:47,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:58:47,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:58:47,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:58:47,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:58:47,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:58:47,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:58:47,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:58:47,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:58:47,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:58:47,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:58:47,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:58:47,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:58:47,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:58:47,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:58:47,423 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 20:58:47,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:58:47,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:58:47,434 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 20:58:47,435 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 20:58:47,435 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 20:58:47,436 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 20:58:47,436 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 20:58:47,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:58:47,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:58:47,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:58:47,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:58:47,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:58:47,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:58:47,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 20:58:47,439 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_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-12-08 20:58:47,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:58:47,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:58:47,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:58:47,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:58:47,469 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:58:47,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-08 20:58:47,503 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/f3ec2eb8d/03e1fe7492414b0d9d616036ce118d14/FLAG2b1dc3048 [2018-12-08 20:58:48,026 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:58:48,026 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-08 20:58:48,035 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/f3ec2eb8d/03e1fe7492414b0d9d616036ce118d14/FLAG2b1dc3048 [2018-12-08 20:58:48,537 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/f3ec2eb8d/03e1fe7492414b0d9d616036ce118d14 [2018-12-08 20:58:48,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:58:48,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:58:48,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:58:48,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:58:48,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:58:48,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79df640a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48, skipping insertion in model container [2018-12-08 20:58:48,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:58:48,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:58:48,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:58:48,817 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:58:48,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:58:48,884 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:58:48,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48 WrapperNode [2018-12-08 20:58:48,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:58:48,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:58:48,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:58:48,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:58:48,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:58:48,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:58:48,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:58:48,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:58:48,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... [2018-12-08 20:58:48,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:58:48,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:58:48,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:58:48,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:58:48,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/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 20:58:48,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:58:48,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:58:48,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:58:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-08 20:58:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-08 20:58:48,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:58:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:58:49,118 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:58:49,118 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:58:49,519 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:58:49,519 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 20:58:49,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:58:49 BoogieIcfgContainer [2018-12-08 20:58:49,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:58:49,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:58:49,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:58:49,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:58:49,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:58:48" (1/3) ... [2018-12-08 20:58:49,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31034f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:58:49, skipping insertion in model container [2018-12-08 20:58:49,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:58:48" (2/3) ... [2018-12-08 20:58:49,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31034f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:58:49, skipping insertion in model container [2018-12-08 20:58:49,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:58:49" (3/3) ... [2018-12-08 20:58:49,526 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-08 20:58:49,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:58:49,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:58:49,555 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:58:49,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:58:49,582 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:58:49,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:58:49,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:58:49,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:58:49,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:58:49,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:58:49,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:58:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-08 20:58:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 20:58:49,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:49,603 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 20:58:49,605 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:49,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-12-08 20:58:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:49,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:49,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:49,781 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 20:58:49,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:49,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:58:49,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:49,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:58:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:58:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:58:49,794 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-08 20:58:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:49,844 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-12-08 20:58:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:58:49,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 20:58:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:49,853 INFO L225 Difference]: With dead ends: 385 [2018-12-08 20:58:49,854 INFO L226 Difference]: Without dead ends: 223 [2018-12-08 20:58:49,856 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 20:58:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-08 20:58:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-08 20:58:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-08 20:58:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-12-08 20:58:49,892 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-12-08 20:58:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:49,893 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-12-08 20:58:49,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:58:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-12-08 20:58:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 20:58:49,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:49,895 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 20:58:49,895 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:49,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-12-08 20:58:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:49,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:49,972 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 20:58:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:58:49,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:49,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:58:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:58:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:58:49,974 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-12-08 20:58:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:50,022 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-12-08 20:58:50,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:58:50,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 20:58:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:50,025 INFO L225 Difference]: With dead ends: 432 [2018-12-08 20:58:50,025 INFO L226 Difference]: Without dead ends: 325 [2018-12-08 20:58:50,026 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 20:58:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-08 20:58:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-12-08 20:58:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-08 20:58:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-12-08 20:58:50,043 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-12-08 20:58:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:50,044 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-12-08 20:58:50,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:58:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-12-08 20:58:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:58:50,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:50,046 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 20:58:50,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:50,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:50,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-12-08 20:58:50,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:50,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:50,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:50,149 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 20:58:50,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:50,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:50,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:50,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:50,150 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-12-08 20:58:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:50,452 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-12-08 20:58:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:50,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 20:58:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:50,454 INFO L225 Difference]: With dead ends: 825 [2018-12-08 20:58:50,454 INFO L226 Difference]: Without dead ends: 513 [2018-12-08 20:58:50,455 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 20:58:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-08 20:58:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-12-08 20:58:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-08 20:58:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-12-08 20:58:50,465 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-12-08 20:58:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:50,466 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-12-08 20:58:50,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-12-08 20:58:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:58:50,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:50,468 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 20:58:50,468 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:50,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1956647801, now seen corresponding path program 1 times [2018-12-08 20:58:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:50,520 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 20:58:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:50,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:50,522 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-12-08 20:58:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:50,730 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-12-08 20:58:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:50,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 20:58:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:50,732 INFO L225 Difference]: With dead ends: 821 [2018-12-08 20:58:50,732 INFO L226 Difference]: Without dead ends: 459 [2018-12-08 20:58:50,733 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 20:58:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-08 20:58:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-12-08 20:58:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-08 20:58:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-12-08 20:58:50,742 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-12-08 20:58:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:50,743 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-12-08 20:58:50,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-12-08 20:58:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:58:50,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:50,744 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 20:58:50,745 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:50,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash -671506196, now seen corresponding path program 1 times [2018-12-08 20:58:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:50,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:50,791 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 20:58:50,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:50,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:50,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:50,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:50,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:50,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:50,792 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-12-08 20:58:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:51,051 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2018-12-08 20:58:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:51,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 20:58:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:51,053 INFO L225 Difference]: With dead ends: 949 [2018-12-08 20:58:51,053 INFO L226 Difference]: Without dead ends: 547 [2018-12-08 20:58:51,054 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 20:58:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-08 20:58:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2018-12-08 20:58:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-08 20:58:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-12-08 20:58:51,067 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-12-08 20:58:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:51,068 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-12-08 20:58:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-12-08 20:58:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 20:58:51,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:51,069 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, 1] [2018-12-08 20:58:51,069 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:51,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 653887364, now seen corresponding path program 1 times [2018-12-08 20:58:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:51,117 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 20:58:51,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:51,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:51,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:51,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:51,118 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-12-08 20:58:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:51,379 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2018-12-08 20:58:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:51,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 20:58:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:51,381 INFO L225 Difference]: With dead ends: 951 [2018-12-08 20:58:51,381 INFO L226 Difference]: Without dead ends: 547 [2018-12-08 20:58:51,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 20:58:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-08 20:58:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2018-12-08 20:58:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-08 20:58:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-12-08 20:58:51,394 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2018-12-08 20:58:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:51,394 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-12-08 20:58:51,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-12-08 20:58:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 20:58:51,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:51,396 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, 1, 1] [2018-12-08 20:58:51,396 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:51,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1208805305, now seen corresponding path program 1 times [2018-12-08 20:58:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:51,446 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 20:58:51,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:51,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:51,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:51,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:51,448 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-12-08 20:58:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:51,722 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2018-12-08 20:58:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:51,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 20:58:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:51,724 INFO L225 Difference]: With dead ends: 943 [2018-12-08 20:58:51,724 INFO L226 Difference]: Without dead ends: 537 [2018-12-08 20:58:51,725 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 20:58:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-08 20:58:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2018-12-08 20:58:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2018-12-08 20:58:51,733 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2018-12-08 20:58:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:51,733 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2018-12-08 20:58:51,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2018-12-08 20:58:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:51,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:51,734 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, 1] [2018-12-08 20:58:51,734 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:51,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:51,734 INFO L82 PathProgramCache]: Analyzing trace with hash -784316286, now seen corresponding path program 1 times [2018-12-08 20:58:51,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:51,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:51,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:51,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:51,773 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 20:58:51,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:51,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:51,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:51,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:51,774 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2018-12-08 20:58:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:51,998 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2018-12-08 20:58:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:52,000 INFO L225 Difference]: With dead ends: 943 [2018-12-08 20:58:52,000 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:58:52,001 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 20:58:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:58:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-08 20:58:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2018-12-08 20:58:52,013 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2018-12-08 20:58:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:52,013 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2018-12-08 20:58:52,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2018-12-08 20:58:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:52,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:52,014 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, 1] [2018-12-08 20:58:52,014 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:52,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -802971744, now seen corresponding path program 1 times [2018-12-08 20:58:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:52,064 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 20:58:52,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:52,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:52,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:52,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:52,065 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2018-12-08 20:58:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:52,280 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2018-12-08 20:58:52,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:52,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:52,282 INFO L225 Difference]: With dead ends: 943 [2018-12-08 20:58:52,282 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:58:52,283 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 20:58:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:58:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-08 20:58:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2018-12-08 20:58:52,290 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2018-12-08 20:58:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:52,290 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2018-12-08 20:58:52,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2018-12-08 20:58:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:52,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:52,291 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:52,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:52,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1508472381, now seen corresponding path program 1 times [2018-12-08 20:58:52,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:52,337 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 20:58:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:52,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:52,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:52,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:52,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:52,339 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2018-12-08 20:58:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:52,600 INFO L93 Difference]: Finished difference Result 794 states and 1181 transitions. [2018-12-08 20:58:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:52,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:52,601 INFO L225 Difference]: With dead ends: 794 [2018-12-08 20:58:52,601 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:58:52,602 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 20:58:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:58:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-08 20:58:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2018-12-08 20:58:52,611 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2018-12-08 20:58:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:52,611 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2018-12-08 20:58:52,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2018-12-08 20:58:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:52,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:52,613 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, 1] [2018-12-08 20:58:52,613 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:52,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:52,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1665283844, now seen corresponding path program 1 times [2018-12-08 20:58:52,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:52,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:52,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:52,662 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 20:58:52,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:52,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:52,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:52,663 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2018-12-08 20:58:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:52,840 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2018-12-08 20:58:52,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:52,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:52,841 INFO L225 Difference]: With dead ends: 871 [2018-12-08 20:58:52,841 INFO L226 Difference]: Without dead ends: 463 [2018-12-08 20:58:52,842 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 20:58:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-08 20:58:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-08 20:58:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-12-08 20:58:52,849 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2018-12-08 20:58:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:52,849 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-12-08 20:58:52,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-12-08 20:58:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:52,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:52,850 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, 1] [2018-12-08 20:58:52,850 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:52,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1646628386, now seen corresponding path program 1 times [2018-12-08 20:58:52,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:52,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:52,886 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 20:58:52,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:52,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:52,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:52,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:52,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:52,887 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-12-08 20:58:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:53,054 INFO L93 Difference]: Finished difference Result 871 states and 1292 transitions. [2018-12-08 20:58:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:53,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:53,055 INFO L225 Difference]: With dead ends: 871 [2018-12-08 20:58:53,055 INFO L226 Difference]: Without dead ends: 463 [2018-12-08 20:58:53,055 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 20:58:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-08 20:58:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-08 20:58:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2018-12-08 20:58:53,066 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2018-12-08 20:58:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:53,067 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2018-12-08 20:58:53,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2018-12-08 20:58:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:58:53,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:53,068 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:53,068 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:53,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash 941127749, now seen corresponding path program 1 times [2018-12-08 20:58:53,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:53,115 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 20:58:53,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:53,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:53,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:53,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:53,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:53,116 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2018-12-08 20:58:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:53,281 INFO L93 Difference]: Finished difference Result 722 states and 1065 transitions. [2018-12-08 20:58:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:53,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 20:58:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:53,282 INFO L225 Difference]: With dead ends: 722 [2018-12-08 20:58:53,282 INFO L226 Difference]: Without dead ends: 463 [2018-12-08 20:58:53,283 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 20:58:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-08 20:58:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-08 20:58:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2018-12-08 20:58:53,292 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2018-12-08 20:58:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:53,292 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2018-12-08 20:58:53,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2018-12-08 20:58:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 20:58:53,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:53,293 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, 1] [2018-12-08 20:58:53,293 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:53,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1290131619, now seen corresponding path program 1 times [2018-12-08 20:58:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:53,325 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 20:58:53,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:53,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:53,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:53,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:53,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:53,326 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2018-12-08 20:58:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:53,579 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2018-12-08 20:58:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:53,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 20:58:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:53,581 INFO L225 Difference]: With dead ends: 943 [2018-12-08 20:58:53,581 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:58:53,581 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 20:58:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:58:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-08 20:58:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2018-12-08 20:58:53,593 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2018-12-08 20:58:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:53,593 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2018-12-08 20:58:53,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2018-12-08 20:58:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 20:58:53,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:53,594 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:53,594 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:53,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:53,595 INFO L82 PathProgramCache]: Analyzing trace with hash 765876928, now seen corresponding path program 1 times [2018-12-08 20:58:53,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:53,641 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 20:58:53,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:53,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:53,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:53,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:53,642 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2018-12-08 20:58:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:53,850 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2018-12-08 20:58:53,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:53,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 20:58:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:53,852 INFO L225 Difference]: With dead ends: 788 [2018-12-08 20:58:53,852 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 20:58:53,852 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 20:58:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 20:58:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-08 20:58:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2018-12-08 20:58:53,863 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2018-12-08 20:58:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:53,863 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2018-12-08 20:58:53,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2018-12-08 20:58:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 20:58:53,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:53,865 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, 1] [2018-12-08 20:58:53,865 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:53,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1633028379, now seen corresponding path program 1 times [2018-12-08 20:58:53,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:53,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:53,914 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 20:58:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:53,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:53,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:53,915 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2018-12-08 20:58:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:54,062 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2018-12-08 20:58:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:54,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 20:58:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:54,063 INFO L225 Difference]: With dead ends: 871 [2018-12-08 20:58:54,063 INFO L226 Difference]: Without dead ends: 463 [2018-12-08 20:58:54,063 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 20:58:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-08 20:58:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-08 20:58:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2018-12-08 20:58:54,070 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2018-12-08 20:58:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:54,070 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2018-12-08 20:58:54,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-12-08 20:58:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 20:58:54,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:54,071 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:54,071 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:54,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2018-12-08 20:58:54,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:54,102 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 20:58:54,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:54,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:54,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:54,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:54,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:54,103 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2018-12-08 20:58:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:54,256 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2018-12-08 20:58:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:54,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 20:58:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:54,257 INFO L225 Difference]: With dead ends: 716 [2018-12-08 20:58:54,257 INFO L226 Difference]: Without dead ends: 457 [2018-12-08 20:58:54,257 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 20:58:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-08 20:58:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-08 20:58:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2018-12-08 20:58:54,270 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2018-12-08 20:58:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:54,270 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2018-12-08 20:58:54,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2018-12-08 20:58:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 20:58:54,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:54,272 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, 1] [2018-12-08 20:58:54,272 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:54,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1753186171, now seen corresponding path program 1 times [2018-12-08 20:58:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:54,322 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 20:58:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:54,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:54,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:54,323 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2018-12-08 20:58:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:54,534 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2018-12-08 20:58:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:54,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 20:58:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:54,536 INFO L225 Difference]: With dead ends: 937 [2018-12-08 20:58:54,536 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 20:58:54,537 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 20:58:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 20:58:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-08 20:58:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2018-12-08 20:58:54,547 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2018-12-08 20:58:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:54,547 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2018-12-08 20:58:54,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2018-12-08 20:58:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 20:58:54,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:54,549 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, 1] [2018-12-08 20:58:54,549 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:54,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1329539449, now seen corresponding path program 1 times [2018-12-08 20:58:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:54,586 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 20:58:54,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:54,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:54,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:54,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:54,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:54,587 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2018-12-08 20:58:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:54,733 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2018-12-08 20:58:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:54,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 20:58:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:54,734 INFO L225 Difference]: With dead ends: 865 [2018-12-08 20:58:54,734 INFO L226 Difference]: Without dead ends: 457 [2018-12-08 20:58:54,735 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 20:58:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-08 20:58:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-08 20:58:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2018-12-08 20:58:54,741 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2018-12-08 20:58:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:54,741 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2018-12-08 20:58:54,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2018-12-08 20:58:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 20:58:54,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:54,742 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, 1] [2018-12-08 20:58:54,742 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:54,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975710, now seen corresponding path program 1 times [2018-12-08 20:58:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:54,784 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 20:58:54,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:54,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:54,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:54,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:54,785 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2018-12-08 20:58:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:54,970 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2018-12-08 20:58:54,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 20:58:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:54,972 INFO L225 Difference]: With dead ends: 919 [2018-12-08 20:58:54,972 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 20:58:54,972 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 20:58:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 20:58:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-08 20:58:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2018-12-08 20:58:54,979 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2018-12-08 20:58:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:54,979 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2018-12-08 20:58:54,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2018-12-08 20:58:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 20:58:54,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:54,980 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 20:58:54,980 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:54,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1134564595, now seen corresponding path program 1 times [2018-12-08 20:58:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:54,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,011 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 20:58:55,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:55,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:55,012 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2018-12-08 20:58:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,189 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2018-12-08 20:58:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:55,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 20:58:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,191 INFO L225 Difference]: With dead ends: 919 [2018-12-08 20:58:55,192 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 20:58:55,192 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 20:58:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 20:58:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-08 20:58:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2018-12-08 20:58:55,201 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2018-12-08 20:58:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,201 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2018-12-08 20:58:55,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2018-12-08 20:58:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 20:58:55,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,202 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, 1] [2018-12-08 20:58:55,202 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1220829216, now seen corresponding path program 1 times [2018-12-08 20:58:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,243 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 20:58:55,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:55,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:55,244 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2018-12-08 20:58:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,373 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2018-12-08 20:58:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:55,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 20:58:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,374 INFO L225 Difference]: With dead ends: 847 [2018-12-08 20:58:55,374 INFO L226 Difference]: Without dead ends: 439 [2018-12-08 20:58:55,375 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 20:58:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-08 20:58:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2018-12-08 20:58:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-08 20:58:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2018-12-08 20:58:55,381 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2018-12-08 20:58:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,381 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2018-12-08 20:58:55,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2018-12-08 20:58:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 20:58:55,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,382 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 20:58:55,382 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1382711089, now seen corresponding path program 1 times [2018-12-08 20:58:55,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,405 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 20:58:55,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:58:55,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:58:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:58:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:58:55,405 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2018-12-08 20:58:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,427 INFO L93 Difference]: Finished difference Result 831 states and 1204 transitions. [2018-12-08 20:58:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:58:55,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-08 20:58:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,429 INFO L225 Difference]: With dead ends: 831 [2018-12-08 20:58:55,429 INFO L226 Difference]: Without dead ends: 574 [2018-12-08 20:58:55,429 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 20:58:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-08 20:58:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-08 20:58:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-08 20:58:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2018-12-08 20:58:55,437 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2018-12-08 20:58:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2018-12-08 20:58:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:58:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2018-12-08 20:58:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 20:58:55,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,438 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 20:58:55,438 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1024261319, now seen corresponding path program 1 times [2018-12-08 20:58:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,464 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 20:58:55,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:58:55,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:58:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:58:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:58:55,465 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2018-12-08 20:58:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,492 INFO L93 Difference]: Finished difference Result 729 states and 1052 transitions. [2018-12-08 20:58:55,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:58:55,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-08 20:58:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,495 INFO L225 Difference]: With dead ends: 729 [2018-12-08 20:58:55,495 INFO L226 Difference]: Without dead ends: 727 [2018-12-08 20:58:55,495 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 20:58:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-08 20:58:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-08 20:58:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-08 20:58:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2018-12-08 20:58:55,511 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2018-12-08 20:58:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,511 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2018-12-08 20:58:55,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:58:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2018-12-08 20:58:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 20:58:55,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,512 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 20:58:55,512 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash 934069236, now seen corresponding path program 1 times [2018-12-08 20:58:55,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:55,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:58:55,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:58:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:58:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:58:55,550 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2018-12-08 20:58:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,572 INFO L93 Difference]: Finished difference Result 729 states and 1050 transitions. [2018-12-08 20:58:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:58:55,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-08 20:58:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,574 INFO L225 Difference]: With dead ends: 729 [2018-12-08 20:58:55,574 INFO L226 Difference]: Without dead ends: 727 [2018-12-08 20:58:55,575 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 20:58:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-08 20:58:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-08 20:58:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-08 20:58:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1048 transitions. [2018-12-08 20:58:55,589 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1048 transitions. Word has length 104 [2018-12-08 20:58:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,589 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1048 transitions. [2018-12-08 20:58:55,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:58:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1048 transitions. [2018-12-08 20:58:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 20:58:55,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,590 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, 1, 1] [2018-12-08 20:58:55,590 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash -148840977, now seen corresponding path program 1 times [2018-12-08 20:58:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:55,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:55,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:55,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:55,632 INFO L87 Difference]: Start difference. First operand 727 states and 1048 transitions. Second operand 4 states. [2018-12-08 20:58:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:55,811 INFO L93 Difference]: Finished difference Result 1698 states and 2461 transitions. [2018-12-08 20:58:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:55,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-08 20:58:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:55,813 INFO L225 Difference]: With dead ends: 1698 [2018-12-08 20:58:55,813 INFO L226 Difference]: Without dead ends: 984 [2018-12-08 20:58:55,813 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 20:58:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-08 20:58:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 847. [2018-12-08 20:58:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-08 20:58:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1258 transitions. [2018-12-08 20:58:55,824 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1258 transitions. Word has length 106 [2018-12-08 20:58:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:55,824 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1258 transitions. [2018-12-08 20:58:55,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1258 transitions. [2018-12-08 20:58:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 20:58:55,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:55,825 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, 1, 1, 1] [2018-12-08 20:58:55,825 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:55,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1084285646, now seen corresponding path program 1 times [2018-12-08 20:58:55,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:55,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:55,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:55,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:55,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:55,885 INFO L87 Difference]: Start difference. First operand 847 states and 1258 transitions. Second operand 4 states. [2018-12-08 20:58:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:56,032 INFO L93 Difference]: Finished difference Result 1813 states and 2661 transitions. [2018-12-08 20:58:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:56,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 20:58:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:56,034 INFO L225 Difference]: With dead ends: 1813 [2018-12-08 20:58:56,034 INFO L226 Difference]: Without dead ends: 979 [2018-12-08 20:58:56,034 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 20:58:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-12-08 20:58:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2018-12-08 20:58:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-08 20:58:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1253 transitions. [2018-12-08 20:58:56,045 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1253 transitions. Word has length 121 [2018-12-08 20:58:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:56,045 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1253 transitions. [2018-12-08 20:58:56,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1253 transitions. [2018-12-08 20:58:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 20:58:56,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:56,046 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:56,046 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:56,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1832311600, now seen corresponding path program 1 times [2018-12-08 20:58:56,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:56,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:56,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:56,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:56,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:56,091 INFO L87 Difference]: Start difference. First operand 847 states and 1253 transitions. Second operand 4 states. [2018-12-08 20:58:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:56,254 INFO L93 Difference]: Finished difference Result 1813 states and 2651 transitions. [2018-12-08 20:58:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:56,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 20:58:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:56,256 INFO L225 Difference]: With dead ends: 1813 [2018-12-08 20:58:56,256 INFO L226 Difference]: Without dead ends: 979 [2018-12-08 20:58:56,256 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 20:58:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-12-08 20:58:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2018-12-08 20:58:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-08 20:58:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1248 transitions. [2018-12-08 20:58:56,268 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1248 transitions. Word has length 121 [2018-12-08 20:58:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:56,268 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1248 transitions. [2018-12-08 20:58:56,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1248 transitions. [2018-12-08 20:58:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 20:58:56,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:56,269 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:56,269 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:56,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:56,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1213590989, now seen corresponding path program 1 times [2018-12-08 20:58:56,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:56,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:56,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-08 20:58:56,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:56,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:56,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:56,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:56,305 INFO L87 Difference]: Start difference. First operand 847 states and 1248 transitions. Second operand 4 states. [2018-12-08 20:58:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:56,449 INFO L93 Difference]: Finished difference Result 1644 states and 2431 transitions. [2018-12-08 20:58:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:56,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 20:58:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:56,450 INFO L225 Difference]: With dead ends: 1644 [2018-12-08 20:58:56,451 INFO L226 Difference]: Without dead ends: 985 [2018-12-08 20:58:56,451 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 20:58:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-08 20:58:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 919. [2018-12-08 20:58:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-08 20:58:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1368 transitions. [2018-12-08 20:58:56,463 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1368 transitions. Word has length 121 [2018-12-08 20:58:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:56,463 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1368 transitions. [2018-12-08 20:58:56,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1368 transitions. [2018-12-08 20:58:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 20:58:56,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:56,464 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:56,464 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:56,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1233245309, now seen corresponding path program 1 times [2018-12-08 20:58:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:56,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:56,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:56,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:56,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:56,505 INFO L87 Difference]: Start difference. First operand 919 states and 1368 transitions. Second operand 4 states. [2018-12-08 20:58:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:56,655 INFO L93 Difference]: Finished difference Result 1957 states and 2881 transitions. [2018-12-08 20:58:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:56,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-08 20:58:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:56,657 INFO L225 Difference]: With dead ends: 1957 [2018-12-08 20:58:56,657 INFO L226 Difference]: Without dead ends: 1051 [2018-12-08 20:58:56,657 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 20:58:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-12-08 20:58:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2018-12-08 20:58:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-08 20:58:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1363 transitions. [2018-12-08 20:58:56,670 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1363 transitions. Word has length 122 [2018-12-08 20:58:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:56,670 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1363 transitions. [2018-12-08 20:58:56,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1363 transitions. [2018-12-08 20:58:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 20:58:56,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:56,671 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:56,671 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:56,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2124457781, now seen corresponding path program 1 times [2018-12-08 20:58:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:56,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:56,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:56,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:56,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:56,702 INFO L87 Difference]: Start difference. First operand 919 states and 1363 transitions. Second operand 4 states. [2018-12-08 20:58:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:56,851 INFO L93 Difference]: Finished difference Result 1957 states and 2871 transitions. [2018-12-08 20:58:56,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:56,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-08 20:58:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:56,854 INFO L225 Difference]: With dead ends: 1957 [2018-12-08 20:58:56,854 INFO L226 Difference]: Without dead ends: 1051 [2018-12-08 20:58:56,855 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 20:58:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-12-08 20:58:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2018-12-08 20:58:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-08 20:58:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1358 transitions. [2018-12-08 20:58:56,868 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1358 transitions. Word has length 123 [2018-12-08 20:58:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:56,868 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1358 transitions. [2018-12-08 20:58:56,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1358 transitions. [2018-12-08 20:58:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 20:58:56,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:56,869 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:56,869 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:56,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash 805588424, now seen corresponding path program 1 times [2018-12-08 20:58:56,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:56,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 20:58:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:56,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:56,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:56,913 INFO L87 Difference]: Start difference. First operand 919 states and 1358 transitions. Second operand 4 states. [2018-12-08 20:58:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:57,058 INFO L93 Difference]: Finished difference Result 1912 states and 2806 transitions. [2018-12-08 20:58:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:57,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 20:58:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:57,060 INFO L225 Difference]: With dead ends: 1912 [2018-12-08 20:58:57,060 INFO L226 Difference]: Without dead ends: 1006 [2018-12-08 20:58:57,061 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 20:58:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-12-08 20:58:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 919. [2018-12-08 20:58:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-08 20:58:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2018-12-08 20:58:57,077 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 124 [2018-12-08 20:58:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:57,077 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2018-12-08 20:58:57,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2018-12-08 20:58:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 20:58:57,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:57,078 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:57,078 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:57,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1158112039, now seen corresponding path program 1 times [2018-12-08 20:58:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-08 20:58:57,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:57,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:58:57,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:57,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:58:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:58:57,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:58:57,134 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 4 states. [2018-12-08 20:58:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:57,307 INFO L93 Difference]: Finished difference Result 2057 states and 3036 transitions. [2018-12-08 20:58:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:58:57,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 20:58:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:57,309 INFO L225 Difference]: With dead ends: 2057 [2018-12-08 20:58:57,309 INFO L226 Difference]: Without dead ends: 1151 [2018-12-08 20:58:57,310 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 20:58:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-12-08 20:58:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1029. [2018-12-08 20:58:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-12-08 20:58:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1543 transitions. [2018-12-08 20:58:57,332 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1543 transitions. Word has length 124 [2018-12-08 20:58:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:57,332 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1543 transitions. [2018-12-08 20:58:57,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:58:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1543 transitions. [2018-12-08 20:58:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 20:58:57,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:57,333 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:57,333 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:57,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash -421436053, now seen corresponding path program 1 times [2018-12-08 20:58:57,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-08 20:58:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:58:57,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:57,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:58:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:58:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:58:57,411 INFO L87 Difference]: Start difference. First operand 1029 states and 1543 transitions. Second operand 6 states. [2018-12-08 20:58:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:57,695 INFO L93 Difference]: Finished difference Result 1934 states and 2904 transitions. [2018-12-08 20:58:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:58:57,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-12-08 20:58:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:57,698 INFO L225 Difference]: With dead ends: 1934 [2018-12-08 20:58:57,698 INFO L226 Difference]: Without dead ends: 1113 [2018-12-08 20:58:57,699 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 20:58:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-12-08 20:58:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1037. [2018-12-08 20:58:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-12-08 20:58:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1556 transitions. [2018-12-08 20:58:57,715 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1556 transitions. Word has length 128 [2018-12-08 20:58:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:57,715 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1556 transitions. [2018-12-08 20:58:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:58:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1556 transitions. [2018-12-08 20:58:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 20:58:57,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:57,716 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:57,717 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:57,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash -527506, now seen corresponding path program 1 times [2018-12-08 20:58:57,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:57,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:57,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:57,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:58:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-08 20:58:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:58:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:58:57,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:58:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:58:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:58:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:58:57,777 INFO L87 Difference]: Start difference. First operand 1037 states and 1556 transitions. Second operand 6 states. [2018-12-08 20:58:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:58:58,067 INFO L93 Difference]: Finished difference Result 1931 states and 2900 transitions. [2018-12-08 20:58:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:58:58,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-12-08 20:58:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:58:58,069 INFO L225 Difference]: With dead ends: 1931 [2018-12-08 20:58:58,069 INFO L226 Difference]: Without dead ends: 1110 [2018-12-08 20:58:58,070 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 20:58:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2018-12-08 20:58:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1038. [2018-12-08 20:58:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2018-12-08 20:58:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1557 transitions. [2018-12-08 20:58:58,086 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1557 transitions. Word has length 129 [2018-12-08 20:58:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:58:58,086 INFO L480 AbstractCegarLoop]: Abstraction has 1038 states and 1557 transitions. [2018-12-08 20:58:58,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:58:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1557 transitions. [2018-12-08 20:58:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 20:58:58,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:58:58,087 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:58:58,087 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:58:58,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:58:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-12-08 20:58:58,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:58:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:58:58,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:58:58,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:58:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:58:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:58:58,313 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 20:58:58,355 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20492 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 20:58:58,356 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 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 20:58:58,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:58:58 BoogieIcfgContainer [2018-12-08 20:58:58,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:58:58,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:58:58,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:58:58,402 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:58:58,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:58:49" (3/4) ... [2018-12-08 20:58:58,405 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 20:58:58,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:58:58,405 INFO L168 Benchmark]: Toolchain (without parser) took 9866.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 954.9 MB in the beginning and 954.2 MB in the end (delta: 672.8 kB). Peak memory consumption was 384.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,406 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:58:58,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:58:58,407 INFO L168 Benchmark]: Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,408 INFO L168 Benchmark]: RCFGBuilder took 565.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,408 INFO L168 Benchmark]: TraceAbstraction took 8881.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.0 GB in the beginning and 965.9 MB in the end (delta: 37.9 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,408 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.4 GB. Free memory was 965.9 MB in the beginning and 954.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:58:58,411 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 565.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8881.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.0 GB in the beginning and 965.9 MB in the end (delta: 37.9 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.4 GB. Free memory was 965.9 MB in the beginning and 954.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20492 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 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20541, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20494: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={20501:0}, SSLv3_client_data={20494:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=12292, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->version=0, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->init_buf={-1:2}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->hit=0, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20537, (s->s3)->tmp.new_cipher={20502:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=0, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1646] __VERIFIER_error() VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=0, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 8.8s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7485 SDtfs, 3047 SDslu, 9993 SDs, 0 SdLazy, 5723 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 70 SyntacticMatches, 46 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=35, 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.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 2754 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3213 NumberOfCodeBlocks, 3213 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 683183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 2861/2861 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 20:58:59,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:58:59,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:58:59,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:58:59,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:58:59,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:58:59,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:58:59,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:58:59,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:58:59,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:58:59,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:58:59,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:58:59,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:58:59,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:58:59,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:58:59,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:58:59,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:58:59,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:58:59,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:58:59,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:58:59,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:58:59,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:58:59,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:58:59,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:58:59,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:58:59,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:58:59,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:58:59,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:58:59,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:58:59,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:58:59,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:58:59,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:58:59,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:58:59,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:58:59,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:58:59,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:58:59,786 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 20:58:59,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:58:59,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:58:59,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:58:59,794 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:58:59,794 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 20:58:59,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 20:58:59,794 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 20:58:59,794 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 20:58:59,794 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 20:58:59,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 20:58:59,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:58:59,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:58:59,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:58:59,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:58:59,795 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:58:59,796 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:58:59,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:58:59,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 20:58:59,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:58:59,798 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 20:58:59,798 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 20:58:59,798 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_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-12-08 20:58:59,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:58:59,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:58:59,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:58:59,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:58:59,826 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:58:59,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-08 20:58:59,862 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/98292c47e/e8390c073906449a81eb744a0c248ae0/FLAG9969ca72a [2018-12-08 20:59:00,319 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:59:00,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-08 20:59:00,328 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/98292c47e/e8390c073906449a81eb744a0c248ae0/FLAG9969ca72a [2018-12-08 20:59:00,336 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7606f6e-0c31-4206-adfb-bf99af92a0cb/bin-2019/utaipan/data/98292c47e/e8390c073906449a81eb744a0c248ae0 [2018-12-08 20:59:00,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:59:00,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:59:00,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:59:00,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:59:00,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:59:00,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:59:00" (1/1) ... [2018-12-08 20:59:00,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c700c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:59:00, skipping insertion in model container [2018-12-08 20:59:00,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:59:00" (1/1) ... [2018-12-08 20:59:00,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:59:00,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:59:00,601 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:59:00,667 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:59:00,743 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:59:00,744 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 20:59:00,747 INFO L168 Benchmark]: Toolchain (without parser) took 409.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:59:00,748 INFO L168 Benchmark]: CDTParser took 0.12 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 20:59:00,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:59:00,750 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 40.0 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...