./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/s3_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:28,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:28,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:28,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:28,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:28,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:28,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:28,968 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:28,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:28,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:28,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:28,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:28,971 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:28,972 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:28,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:28,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:28,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:28,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:28,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:28,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:28,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:28,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:28,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:28,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:28,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:28,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:28,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:28,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:28,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:28,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:28,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:28,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:28,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:28,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:28,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:28,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:28,987 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 08:34:28,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:28,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:28,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:34:28,994 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 08:34:28,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:28,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:28,995 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:28,995 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:28,995 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:28,996 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:34:28,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:28,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:28,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:34:28,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:34:28,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:28,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:34:28,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:34:28,998 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_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-18 08:34:29,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:29,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:29,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:29,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:29,032 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:29,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-18 08:34:29,069 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/259cbe554/c8ded85abeb441b58b587d9ab2ef7390/FLAGf8d7dffc8 [2018-11-18 08:34:29,561 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:29,562 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-18 08:34:29,572 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/259cbe554/c8ded85abeb441b58b587d9ab2ef7390/FLAGf8d7dffc8 [2018-11-18 08:34:30,048 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/259cbe554/c8ded85abeb441b58b587d9ab2ef7390 [2018-11-18 08:34:30,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:30,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:34:30,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:30,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:30,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:30,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720d3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30, skipping insertion in model container [2018-11-18 08:34:30,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:30,100 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:30,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:30,593 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:30,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:30,911 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:30,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30 WrapperNode [2018-11-18 08:34:30,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:30,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:30,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:30,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:30,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:30,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:30,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:34:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 08:34:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-18 08:34:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 08:34:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-18 08:34:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:31,472 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 08:34:31,473 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 08:34:31,874 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:31,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:31 BoogieIcfgContainer [2018-11-18 08:34:31,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:31,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:34:31,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:34:31,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:34:31,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:30" (1/3) ... [2018-11-18 08:34:31,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a02af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:31, skipping insertion in model container [2018-11-18 08:34:31,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (2/3) ... [2018-11-18 08:34:31,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a02af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:31, skipping insertion in model container [2018-11-18 08:34:31,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:31" (3/3) ... [2018-11-18 08:34:31,881 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-18 08:34:31,888 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:34:31,894 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:34:31,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:34:31,927 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:31,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:34:31,928 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:34:31,928 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:34:31,928 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:31,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:31,929 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:34:31,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:31,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:34:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-18 08:34:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:34:31,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,954 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1476026048, now seen corresponding path program 1 times [2018-11-18 08:34:31,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:32,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,205 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-18 08:34:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,327 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-18 08:34:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:32,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:34:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:32,341 INFO L225 Difference]: With dead ends: 388 [2018-11-18 08:34:32,341 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 08:34:32,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 08:34:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-18 08:34:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 08:34:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-18 08:34:32,393 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-18 08:34:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:32,393 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-18 08:34:32,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-18 08:34:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 08:34:32,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:32,395 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:32,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1996210292, now seen corresponding path program 1 times [2018-11-18 08:34:32,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:32,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,480 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-18 08:34:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,533 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-18 08:34:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:32,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 08:34:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:32,537 INFO L225 Difference]: With dead ends: 436 [2018-11-18 08:34:32,537 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 08:34:32,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 08:34:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-18 08:34:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 08:34:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-18 08:34:32,556 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-18 08:34:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:32,556 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-18 08:34:32,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-18 08:34:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 08:34:32,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:32,558 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,558 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:32,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1585213589, now seen corresponding path program 1 times [2018-11-18 08:34:32,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:32,676 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 4 states. [2018-11-18 08:34:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,293 INFO L93 Difference]: Finished difference Result 833 states and 1224 transitions. [2018-11-18 08:34:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:33,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-18 08:34:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:33,295 INFO L225 Difference]: With dead ends: 833 [2018-11-18 08:34:33,295 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 08:34:33,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 08:34:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2018-11-18 08:34:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-18 08:34:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 567 transitions. [2018-11-18 08:34:33,315 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 567 transitions. Word has length 66 [2018-11-18 08:34:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:33,315 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 567 transitions. [2018-11-18 08:34:33,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 567 transitions. [2018-11-18 08:34:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 08:34:33,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:33,318 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,318 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:33,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1444664979, now seen corresponding path program 1 times [2018-11-18 08:34:33,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:33,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:33,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:33,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:33,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:33,408 INFO L87 Difference]: Start difference. First operand 380 states and 567 transitions. Second operand 4 states. [2018-11-18 08:34:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,922 INFO L93 Difference]: Finished difference Result 833 states and 1244 transitions. [2018-11-18 08:34:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:33,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-18 08:34:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:33,927 INFO L225 Difference]: With dead ends: 833 [2018-11-18 08:34:33,927 INFO L226 Difference]: Without dead ends: 466 [2018-11-18 08:34:33,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-18 08:34:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 422. [2018-11-18 08:34:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-18 08:34:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2018-11-18 08:34:33,941 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 66 [2018-11-18 08:34:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:33,942 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2018-11-18 08:34:33,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2018-11-18 08:34:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 08:34:33,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:33,944 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,944 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:33,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1901398877, now seen corresponding path program 1 times [2018-11-18 08:34:33,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:34,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:34,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:34,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:34,020 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2018-11-18 08:34:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:34,612 INFO L93 Difference]: Finished difference Result 963 states and 1443 transitions. [2018-11-18 08:34:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:34,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-18 08:34:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:34,615 INFO L225 Difference]: With dead ends: 963 [2018-11-18 08:34:34,615 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 08:34:34,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 08:34:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 424. [2018-11-18 08:34:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-18 08:34:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 639 transitions. [2018-11-18 08:34:34,629 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 639 transitions. Word has length 67 [2018-11-18 08:34:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:34,630 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 639 transitions. [2018-11-18 08:34:34,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 639 transitions. [2018-11-18 08:34:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 08:34:34,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:34,631 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:34,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1181919942, now seen corresponding path program 1 times [2018-11-18 08:34:34,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:34,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:34,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:34,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:34,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:34,690 INFO L87 Difference]: Start difference. First operand 424 states and 639 transitions. Second operand 4 states. [2018-11-18 08:34:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:35,351 INFO L93 Difference]: Finished difference Result 965 states and 1443 transitions. [2018-11-18 08:34:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:35,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-18 08:34:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:35,355 INFO L225 Difference]: With dead ends: 965 [2018-11-18 08:34:35,359 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 08:34:35,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 08:34:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 426. [2018-11-18 08:34:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-18 08:34:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 641 transitions. [2018-11-18 08:34:35,373 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 641 transitions. Word has length 68 [2018-11-18 08:34:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:35,373 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 641 transitions. [2018-11-18 08:34:35,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 641 transitions. [2018-11-18 08:34:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 08:34:35,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:35,375 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,375 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:35,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2019664546, now seen corresponding path program 1 times [2018-11-18 08:34:35,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:35,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:35,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:35,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:35,437 INFO L87 Difference]: Start difference. First operand 426 states and 641 transitions. Second operand 4 states. [2018-11-18 08:34:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,212 INFO L93 Difference]: Finished difference Result 957 states and 1431 transitions. [2018-11-18 08:34:36,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:36,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-11-18 08:34:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:36,218 INFO L225 Difference]: With dead ends: 957 [2018-11-18 08:34:36,218 INFO L226 Difference]: Without dead ends: 544 [2018-11-18 08:34:36,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-18 08:34:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 428. [2018-11-18 08:34:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 643 transitions. [2018-11-18 08:34:36,233 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 643 transitions. Word has length 69 [2018-11-18 08:34:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:36,234 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 643 transitions. [2018-11-18 08:34:36,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 643 transitions. [2018-11-18 08:34:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:36,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:36,235 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:36,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1926842370, now seen corresponding path program 1 times [2018-11-18 08:34:36,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:36,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:36,299 INFO L87 Difference]: Start difference. First operand 428 states and 643 transitions. Second operand 4 states. [2018-11-18 08:34:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,878 INFO L93 Difference]: Finished difference Result 957 states and 1429 transitions. [2018-11-18 08:34:36,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:36,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:36,881 INFO L225 Difference]: With dead ends: 957 [2018-11-18 08:34:36,881 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 08:34:36,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 08:34:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 08:34:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 641 transitions. [2018-11-18 08:34:36,895 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 641 transitions. Word has length 82 [2018-11-18 08:34:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:36,895 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 641 transitions. [2018-11-18 08:34:36,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 641 transitions. [2018-11-18 08:34:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:36,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:36,897 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,897 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:36,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1789805728, now seen corresponding path program 1 times [2018-11-18 08:34:36,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:36,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:36,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:36,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:36,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:36,983 INFO L87 Difference]: Start difference. First operand 428 states and 641 transitions. Second operand 4 states. [2018-11-18 08:34:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:37,313 INFO L93 Difference]: Finished difference Result 957 states and 1425 transitions. [2018-11-18 08:34:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:37,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:37,314 INFO L225 Difference]: With dead ends: 957 [2018-11-18 08:34:37,314 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 08:34:37,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 08:34:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 08:34:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 639 transitions. [2018-11-18 08:34:37,325 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 639 transitions. Word has length 82 [2018-11-18 08:34:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:37,326 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 639 transitions. [2018-11-18 08:34:37,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 639 transitions. [2018-11-18 08:34:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:37,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:37,327 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:37,327 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:37,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1394122461, now seen corresponding path program 1 times [2018-11-18 08:34:37,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:37,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:37,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:37,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:37,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:37,401 INFO L87 Difference]: Start difference. First operand 428 states and 639 transitions. Second operand 4 states. [2018-11-18 08:34:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:37,705 INFO L93 Difference]: Finished difference Result 805 states and 1192 transitions. [2018-11-18 08:34:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:37,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:37,707 INFO L225 Difference]: With dead ends: 805 [2018-11-18 08:34:37,707 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 08:34:37,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 08:34:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 08:34:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 637 transitions. [2018-11-18 08:34:37,717 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 637 transitions. Word has length 82 [2018-11-18 08:34:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:37,717 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 637 transitions. [2018-11-18 08:34:37,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 637 transitions. [2018-11-18 08:34:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:37,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:37,718 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:37,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:37,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1503195648, now seen corresponding path program 1 times [2018-11-18 08:34:37,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:37,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:37,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:37,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:37,767 INFO L87 Difference]: Start difference. First operand 428 states and 637 transitions. Second operand 4 states. [2018-11-18 08:34:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:37,975 INFO L93 Difference]: Finished difference Result 885 states and 1310 transitions. [2018-11-18 08:34:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:37,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:37,977 INFO L225 Difference]: With dead ends: 885 [2018-11-18 08:34:37,977 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 08:34:37,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 08:34:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 08:34:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 635 transitions. [2018-11-18 08:34:37,990 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 635 transitions. Word has length 82 [2018-11-18 08:34:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:37,991 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 635 transitions. [2018-11-18 08:34:37,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 635 transitions. [2018-11-18 08:34:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:37,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:37,992 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:37,992 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:37,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2081514846, now seen corresponding path program 1 times [2018-11-18 08:34:37,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:38,043 INFO L87 Difference]: Start difference. First operand 428 states and 635 transitions. Second operand 4 states. [2018-11-18 08:34:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:38,338 INFO L93 Difference]: Finished difference Result 885 states and 1306 transitions. [2018-11-18 08:34:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:38,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:38,339 INFO L225 Difference]: With dead ends: 885 [2018-11-18 08:34:38,339 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 08:34:38,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 08:34:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 08:34:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2018-11-18 08:34:38,352 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 82 [2018-11-18 08:34:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:38,352 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2018-11-18 08:34:38,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2018-11-18 08:34:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:34:38,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:38,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:38,354 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:38,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1817769183, now seen corresponding path program 1 times [2018-11-18 08:34:38,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:38,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:38,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:38,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:38,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:38,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:38,438 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2018-11-18 08:34:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:38,741 INFO L93 Difference]: Finished difference Result 733 states and 1076 transitions. [2018-11-18 08:34:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:38,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-18 08:34:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:38,743 INFO L225 Difference]: With dead ends: 733 [2018-11-18 08:34:38,743 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 08:34:38,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 08:34:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 08:34:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2018-11-18 08:34:38,752 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 82 [2018-11-18 08:34:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:38,752 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2018-11-18 08:34:38,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2018-11-18 08:34:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 08:34:38,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:38,753 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:38,754 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:38,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1669103000, now seen corresponding path program 1 times [2018-11-18 08:34:38,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:38,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:38,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:38,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:38,789 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2018-11-18 08:34:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:39,068 INFO L93 Difference]: Finished difference Result 957 states and 1405 transitions. [2018-11-18 08:34:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:39,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 08:34:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:39,069 INFO L225 Difference]: With dead ends: 957 [2018-11-18 08:34:39,070 INFO L226 Difference]: Without dead ends: 542 [2018-11-18 08:34:39,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-18 08:34:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2018-11-18 08:34:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2018-11-18 08:34:39,084 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 83 [2018-11-18 08:34:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:39,084 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2018-11-18 08:34:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2018-11-18 08:34:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 08:34:39,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:39,085 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:39,086 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:39,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 980858517, now seen corresponding path program 1 times [2018-11-18 08:34:39,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:39,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:39,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:39,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:39,136 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2018-11-18 08:34:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:39,701 INFO L93 Difference]: Finished difference Result 799 states and 1170 transitions. [2018-11-18 08:34:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:39,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 08:34:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:39,703 INFO L225 Difference]: With dead ends: 799 [2018-11-18 08:34:39,703 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 08:34:39,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 08:34:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 428. [2018-11-18 08:34:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2018-11-18 08:34:39,712 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 83 [2018-11-18 08:34:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:39,712 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2018-11-18 08:34:39,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2018-11-18 08:34:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 08:34:39,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:39,714 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:39,714 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:39,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1917249494, now seen corresponding path program 1 times [2018-11-18 08:34:39,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:39,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:39,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:39,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:39,772 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 4 states. [2018-11-18 08:34:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:40,229 INFO L93 Difference]: Finished difference Result 885 states and 1290 transitions. [2018-11-18 08:34:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:40,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 08:34:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:40,231 INFO L225 Difference]: With dead ends: 885 [2018-11-18 08:34:40,232 INFO L226 Difference]: Without dead ends: 470 [2018-11-18 08:34:40,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-18 08:34:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 428. [2018-11-18 08:34:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2018-11-18 08:34:40,246 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 83 [2018-11-18 08:34:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:40,246 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2018-11-18 08:34:40,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2018-11-18 08:34:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 08:34:40,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:40,248 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:40,248 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:40,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1229005011, now seen corresponding path program 1 times [2018-11-18 08:34:40,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:40,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:40,374 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 4 states. [2018-11-18 08:34:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:40,917 INFO L93 Difference]: Finished difference Result 727 states and 1057 transitions. [2018-11-18 08:34:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:40,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-18 08:34:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:40,918 INFO L225 Difference]: With dead ends: 727 [2018-11-18 08:34:40,918 INFO L226 Difference]: Without dead ends: 464 [2018-11-18 08:34:40,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-18 08:34:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 428. [2018-11-18 08:34:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 623 transitions. [2018-11-18 08:34:40,926 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 623 transitions. Word has length 83 [2018-11-18 08:34:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:40,926 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 623 transitions. [2018-11-18 08:34:40,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2018-11-18 08:34:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:34:40,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:40,927 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:40,927 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:40,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 761701115, now seen corresponding path program 1 times [2018-11-18 08:34:40,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:40,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:40,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:40,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:40,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:40,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:40,971 INFO L87 Difference]: Start difference. First operand 428 states and 623 transitions. Second operand 4 states. [2018-11-18 08:34:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:41,389 INFO L93 Difference]: Finished difference Result 951 states and 1382 transitions. [2018-11-18 08:34:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:41,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-18 08:34:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:41,391 INFO L225 Difference]: With dead ends: 951 [2018-11-18 08:34:41,392 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 08:34:41,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 08:34:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 428. [2018-11-18 08:34:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-11-18 08:34:41,401 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 84 [2018-11-18 08:34:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:41,401 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-11-18 08:34:41,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-11-18 08:34:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:34:41,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:41,402 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:41,402 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -135692163, now seen corresponding path program 1 times [2018-11-18 08:34:41,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:41,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:41,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:41,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:41,439 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 4 states. [2018-11-18 08:34:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:41,952 INFO L93 Difference]: Finished difference Result 879 states and 1271 transitions. [2018-11-18 08:34:41,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:41,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-18 08:34:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:41,953 INFO L225 Difference]: With dead ends: 879 [2018-11-18 08:34:41,954 INFO L226 Difference]: Without dead ends: 464 [2018-11-18 08:34:41,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-18 08:34:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 428. [2018-11-18 08:34:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 619 transitions. [2018-11-18 08:34:41,961 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 619 transitions. Word has length 84 [2018-11-18 08:34:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:41,962 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 619 transitions. [2018-11-18 08:34:41,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 619 transitions. [2018-11-18 08:34:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:34:41,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:41,963 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:41,963 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:41,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1236429139, now seen corresponding path program 1 times [2018-11-18 08:34:41,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:41,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:42,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:42,010 INFO L87 Difference]: Start difference. First operand 428 states and 619 transitions. Second operand 4 states. [2018-11-18 08:34:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:42,431 INFO L93 Difference]: Finished difference Result 933 states and 1352 transitions. [2018-11-18 08:34:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:42,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 08:34:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:42,433 INFO L225 Difference]: With dead ends: 933 [2018-11-18 08:34:42,433 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 08:34:42,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 08:34:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 428. [2018-11-18 08:34:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 617 transitions. [2018-11-18 08:34:42,444 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 617 transitions. Word has length 85 [2018-11-18 08:34:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:42,445 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 617 transitions. [2018-11-18 08:34:42,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 617 transitions. [2018-11-18 08:34:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:34:42,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:42,446 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:42,446 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:42,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 341799970, now seen corresponding path program 1 times [2018-11-18 08:34:42,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:42,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:42,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:42,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:42,509 INFO L87 Difference]: Start difference. First operand 428 states and 617 transitions. Second operand 4 states. [2018-11-18 08:34:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:42,845 INFO L93 Difference]: Finished difference Result 933 states and 1348 transitions. [2018-11-18 08:34:42,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:42,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 08:34:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:42,846 INFO L225 Difference]: With dead ends: 933 [2018-11-18 08:34:42,846 INFO L226 Difference]: Without dead ends: 518 [2018-11-18 08:34:42,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-18 08:34:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 428. [2018-11-18 08:34:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 615 transitions. [2018-11-18 08:34:42,858 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 615 transitions. Word has length 85 [2018-11-18 08:34:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:42,859 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 615 transitions. [2018-11-18 08:34:42,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 615 transitions. [2018-11-18 08:34:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:34:42,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:42,860 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:42,860 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:42,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash -812958703, now seen corresponding path program 1 times [2018-11-18 08:34:42,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:42,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:42,930 INFO L87 Difference]: Start difference. First operand 428 states and 615 transitions. Second operand 4 states. [2018-11-18 08:34:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,077 INFO L93 Difference]: Finished difference Result 861 states and 1237 transitions. [2018-11-18 08:34:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:43,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 08:34:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:43,079 INFO L225 Difference]: With dead ends: 861 [2018-11-18 08:34:43,079 INFO L226 Difference]: Without dead ends: 446 [2018-11-18 08:34:43,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-18 08:34:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 428. [2018-11-18 08:34:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 08:34:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 613 transitions. [2018-11-18 08:34:43,091 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 613 transitions. Word has length 85 [2018-11-18 08:34:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,091 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 613 transitions. [2018-11-18 08:34:43,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 613 transitions. [2018-11-18 08:34:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:34:43,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,092 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,093 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1707587872, now seen corresponding path program 1 times [2018-11-18 08:34:43,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 08:34:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:43,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,143 INFO L87 Difference]: Start difference. First operand 428 states and 613 transitions. Second operand 3 states. [2018-11-18 08:34:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,188 INFO L93 Difference]: Finished difference Result 845 states and 1218 transitions. [2018-11-18 08:34:43,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:43,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 08:34:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:43,190 INFO L225 Difference]: With dead ends: 845 [2018-11-18 08:34:43,190 INFO L226 Difference]: Without dead ends: 584 [2018-11-18 08:34:43,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-18 08:34:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2018-11-18 08:34:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-18 08:34:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 837 transitions. [2018-11-18 08:34:43,201 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 837 transitions. Word has length 85 [2018-11-18 08:34:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,202 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 837 transitions. [2018-11-18 08:34:43,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 837 transitions. [2018-11-18 08:34:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 08:34:43,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,203 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,203 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 954300010, now seen corresponding path program 1 times [2018-11-18 08:34:43,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 08:34:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:43,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,239 INFO L87 Difference]: Start difference. First operand 584 states and 837 transitions. Second operand 3 states. [2018-11-18 08:34:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,268 INFO L93 Difference]: Finished difference Result 742 states and 1065 transitions. [2018-11-18 08:34:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:43,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-18 08:34:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:43,270 INFO L225 Difference]: With dead ends: 742 [2018-11-18 08:34:43,270 INFO L226 Difference]: Without dead ends: 740 [2018-11-18 08:34:43,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-18 08:34:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-11-18 08:34:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-18 08:34:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1062 transitions. [2018-11-18 08:34:43,282 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1062 transitions. Word has length 87 [2018-11-18 08:34:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,282 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 1062 transitions. [2018-11-18 08:34:43,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1062 transitions. [2018-11-18 08:34:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 08:34:43,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,284 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,284 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash -113038099, now seen corresponding path program 1 times [2018-11-18 08:34:43,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:43,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:43,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,320 INFO L87 Difference]: Start difference. First operand 740 states and 1062 transitions. Second operand 3 states. [2018-11-18 08:34:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,359 INFO L93 Difference]: Finished difference Result 1310 states and 1885 transitions. [2018-11-18 08:34:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:43,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-18 08:34:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:43,361 INFO L225 Difference]: With dead ends: 1310 [2018-11-18 08:34:43,361 INFO L226 Difference]: Without dead ends: 737 [2018-11-18 08:34:43,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-18 08:34:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2018-11-18 08:34:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 08:34:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1052 transitions. [2018-11-18 08:34:43,380 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1052 transitions. Word has length 109 [2018-11-18 08:34:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,380 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1052 transitions. [2018-11-18 08:34:43,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1052 transitions. [2018-11-18 08:34:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 08:34:43,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,381 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,382 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1396641848, now seen corresponding path program 1 times [2018-11-18 08:34:43,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:43,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:43,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:43,464 INFO L87 Difference]: Start difference. First operand 737 states and 1052 transitions. Second operand 4 states. [2018-11-18 08:34:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:43,805 INFO L93 Difference]: Finished difference Result 1723 states and 2470 transitions. [2018-11-18 08:34:43,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:43,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-18 08:34:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:43,811 INFO L225 Difference]: With dead ends: 1723 [2018-11-18 08:34:43,811 INFO L226 Difference]: Without dead ends: 999 [2018-11-18 08:34:43,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-11-18 08:34:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 862. [2018-11-18 08:34:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-18 08:34:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1267 transitions. [2018-11-18 08:34:43,832 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1267 transitions. Word has length 111 [2018-11-18 08:34:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 862 states and 1267 transitions. [2018-11-18 08:34:43,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1267 transitions. [2018-11-18 08:34:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 08:34:43,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,834 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,834 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1248197531, now seen corresponding path program 1 times [2018-11-18 08:34:43,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:43,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:43,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:43,889 INFO L87 Difference]: Start difference. First operand 862 states and 1267 transitions. Second operand 4 states. [2018-11-18 08:34:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:44,207 INFO L93 Difference]: Finished difference Result 1843 states and 2675 transitions. [2018-11-18 08:34:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:44,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 08:34:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:44,210 INFO L225 Difference]: With dead ends: 1843 [2018-11-18 08:34:44,210 INFO L226 Difference]: Without dead ends: 994 [2018-11-18 08:34:44,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-11-18 08:34:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 862. [2018-11-18 08:34:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-18 08:34:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1262 transitions. [2018-11-18 08:34:44,224 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1262 transitions. Word has length 127 [2018-11-18 08:34:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:44,224 INFO L480 AbstractCegarLoop]: Abstraction has 862 states and 1262 transitions. [2018-11-18 08:34:44,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1262 transitions. [2018-11-18 08:34:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 08:34:44,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:44,226 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:44,226 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:44,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -465770563, now seen corresponding path program 1 times [2018-11-18 08:34:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:44,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:44,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:44,293 INFO L87 Difference]: Start difference. First operand 862 states and 1262 transitions. Second operand 4 states. [2018-11-18 08:34:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:44,655 INFO L93 Difference]: Finished difference Result 1843 states and 2665 transitions. [2018-11-18 08:34:44,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:44,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 08:34:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:44,657 INFO L225 Difference]: With dead ends: 1843 [2018-11-18 08:34:44,657 INFO L226 Difference]: Without dead ends: 994 [2018-11-18 08:34:44,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-11-18 08:34:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 862. [2018-11-18 08:34:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-18 08:34:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1257 transitions. [2018-11-18 08:34:44,670 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1257 transitions. Word has length 127 [2018-11-18 08:34:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:44,670 INFO L480 AbstractCegarLoop]: Abstraction has 862 states and 1257 transitions. [2018-11-18 08:34:44,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1257 transitions. [2018-11-18 08:34:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 08:34:44,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:44,671 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:44,671 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:44,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1534699194, now seen corresponding path program 1 times [2018-11-18 08:34:44,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:44,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-18 08:34:44,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:44,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:44,735 INFO L87 Difference]: Start difference. First operand 862 states and 1257 transitions. Second operand 4 states. [2018-11-18 08:34:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:45,292 INFO L93 Difference]: Finished difference Result 1674 states and 2447 transitions. [2018-11-18 08:34:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:45,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 08:34:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:45,295 INFO L225 Difference]: With dead ends: 1674 [2018-11-18 08:34:45,295 INFO L226 Difference]: Without dead ends: 1004 [2018-11-18 08:34:45,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-11-18 08:34:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 938. [2018-11-18 08:34:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1381 transitions. [2018-11-18 08:34:45,310 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1381 transitions. Word has length 127 [2018-11-18 08:34:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:45,310 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1381 transitions. [2018-11-18 08:34:45,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1381 transitions. [2018-11-18 08:34:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 08:34:45,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:45,312 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:45,312 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:45,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2005868303, now seen corresponding path program 1 times [2018-11-18 08:34:45,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:45,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:45,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:45,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:45,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:45,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:45,377 INFO L87 Difference]: Start difference. First operand 938 states and 1381 transitions. Second operand 4 states. [2018-11-18 08:34:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:45,978 INFO L93 Difference]: Finished difference Result 1995 states and 2903 transitions. [2018-11-18 08:34:45,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:45,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-18 08:34:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:45,981 INFO L225 Difference]: With dead ends: 1995 [2018-11-18 08:34:45,981 INFO L226 Difference]: Without dead ends: 1070 [2018-11-18 08:34:45,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-11-18 08:34:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 938. [2018-11-18 08:34:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1376 transitions. [2018-11-18 08:34:45,995 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1376 transitions. Word has length 128 [2018-11-18 08:34:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:45,995 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1376 transitions. [2018-11-18 08:34:45,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1376 transitions. [2018-11-18 08:34:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 08:34:45,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:45,996 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:45,996 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1671765288, now seen corresponding path program 1 times [2018-11-18 08:34:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:46,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:46,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:46,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:46,049 INFO L87 Difference]: Start difference. First operand 938 states and 1376 transitions. Second operand 4 states. [2018-11-18 08:34:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:46,283 INFO L93 Difference]: Finished difference Result 1995 states and 2893 transitions. [2018-11-18 08:34:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:46,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-18 08:34:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:46,286 INFO L225 Difference]: With dead ends: 1995 [2018-11-18 08:34:46,286 INFO L226 Difference]: Without dead ends: 1070 [2018-11-18 08:34:46,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-11-18 08:34:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 938. [2018-11-18 08:34:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1371 transitions. [2018-11-18 08:34:46,306 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1371 transitions. Word has length 129 [2018-11-18 08:34:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:46,306 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1371 transitions. [2018-11-18 08:34:46,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1371 transitions. [2018-11-18 08:34:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 08:34:46,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:46,307 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:46,307 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:46,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 927986284, now seen corresponding path program 1 times [2018-11-18 08:34:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:46,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:46,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:46,391 INFO L87 Difference]: Start difference. First operand 938 states and 1371 transitions. Second operand 4 states. [2018-11-18 08:34:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:46,657 INFO L93 Difference]: Finished difference Result 1950 states and 2828 transitions. [2018-11-18 08:34:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:46,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-18 08:34:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:46,659 INFO L225 Difference]: With dead ends: 1950 [2018-11-18 08:34:46,659 INFO L226 Difference]: Without dead ends: 1025 [2018-11-18 08:34:46,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-11-18 08:34:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 938. [2018-11-18 08:34:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1366 transitions. [2018-11-18 08:34:46,674 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1366 transitions. Word has length 130 [2018-11-18 08:34:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:46,674 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1366 transitions. [2018-11-18 08:34:46,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1366 transitions. [2018-11-18 08:34:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 08:34:46,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:46,675 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:46,676 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:46,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash 182814075, now seen corresponding path program 1 times [2018-11-18 08:34:46,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:46,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:46,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:46,742 INFO L87 Difference]: Start difference. First operand 938 states and 1366 transitions. Second operand 4 states. [2018-11-18 08:34:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:46,984 INFO L93 Difference]: Finished difference Result 1950 states and 2818 transitions. [2018-11-18 08:34:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:46,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-18 08:34:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:46,986 INFO L225 Difference]: With dead ends: 1950 [2018-11-18 08:34:46,986 INFO L226 Difference]: Without dead ends: 1025 [2018-11-18 08:34:46,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-11-18 08:34:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 938. [2018-11-18 08:34:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1361 transitions. [2018-11-18 08:34:47,001 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1361 transitions. Word has length 130 [2018-11-18 08:34:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:47,001 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1361 transitions. [2018-11-18 08:34:47,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1361 transitions. [2018-11-18 08:34:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 08:34:47,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:47,002 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:47,002 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:47,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1490281031, now seen corresponding path program 1 times [2018-11-18 08:34:47,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:47,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:47,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:47,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:34:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:47,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:47,053 INFO L87 Difference]: Start difference. First operand 938 states and 1361 transitions. Second operand 4 states. [2018-11-18 08:34:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:47,450 INFO L93 Difference]: Finished difference Result 1925 states and 2776 transitions. [2018-11-18 08:34:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:47,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-18 08:34:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:47,453 INFO L225 Difference]: With dead ends: 1925 [2018-11-18 08:34:47,453 INFO L226 Difference]: Without dead ends: 1000 [2018-11-18 08:34:47,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-11-18 08:34:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 938. [2018-11-18 08:34:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 08:34:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1356 transitions. [2018-11-18 08:34:47,477 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1356 transitions. Word has length 131 [2018-11-18 08:34:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:47,478 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1356 transitions. [2018-11-18 08:34:47,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:34:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1356 transitions. [2018-11-18 08:34:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 08:34:47,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:47,479 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:47,479 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:47,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash 136236393, now seen corresponding path program 1 times [2018-11-18 08:34:47,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:47,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:47,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-18 08:34:47,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:47,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:34:47,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:34:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:47,618 INFO L87 Difference]: Start difference. First operand 938 states and 1356 transitions. Second operand 6 states. [2018-11-18 08:34:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:47,810 INFO L93 Difference]: Finished difference Result 1868 states and 2701 transitions. [2018-11-18 08:34:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:34:47,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-18 08:34:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:47,811 INFO L225 Difference]: With dead ends: 1868 [2018-11-18 08:34:47,812 INFO L226 Difference]: Without dead ends: 943 [2018-11-18 08:34:47,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-18 08:34:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 942. [2018-11-18 08:34:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-11-18 08:34:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1360 transitions. [2018-11-18 08:34:47,826 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1360 transitions. Word has length 134 [2018-11-18 08:34:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:47,826 INFO L480 AbstractCegarLoop]: Abstraction has 942 states and 1360 transitions. [2018-11-18 08:34:47,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:34:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1360 transitions. [2018-11-18 08:34:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 08:34:47,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:47,827 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:47,827 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:47,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -337340554, now seen corresponding path program 1 times [2018-11-18 08:34:47,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:47,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:47,978 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 08:34:48,013 WARN L1239 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-11-18 08:34:48,014 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-18 08:34:48,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:34:48 BoogieIcfgContainer [2018-11-18 08:34:48,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:34:48,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:48,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:48,060 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:48,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:31" (3/4) ... [2018-11-18 08:34:48,064 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:48,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:48,067 INFO L168 Benchmark]: Toolchain (without parser) took 18016.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 387.4 MB). Free memory was 957.6 MB in the beginning and 988.5 MB in the end (delta: -30.9 MB). Peak memory consumption was 356.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:48,068 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:48,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:48,069 INFO L168 Benchmark]: Boogie Preprocessor took 78.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:48,069 INFO L168 Benchmark]: RCFGBuilder took 883.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 90.9 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:48,070 INFO L168 Benchmark]: TraceAbstraction took 16185.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 975.8 MB in the beginning and 988.5 MB in the end (delta: -12.8 MB). Peak memory consumption was 210.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:48,070 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 988.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:48,072 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 860.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 883.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 90.9 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16185.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 975.8 MB in the beginning and 988.5 MB in the end (delta: -12.8 MB). Peak memory consumption was 210.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.4 GB. Free memory is still 988.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 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)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20486, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20491:0}] [L1062] SSL *s ; [L1066] EXPR, FCALL malloc (sizeof (SSL)) [L1066] s = malloc (sizeof (SSL)) [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) [L1069] FCALL s->state = 12292 [L1070] FCALL s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={20482:0}, SSLv3_client_data={20491:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] FCALL s->state = 12292 [L1102] FCALL s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR, FCALL malloc(sizeof(int)) [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] FCALL *tmp___0 = 0 [L1110] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->info_callback={11:-10}, skip=0, SSLv3_client_data={20491:0}, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake [L1119] FCALL s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=12292, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 [L1237] FCALL s->state = 4096 [L1238] EXPR, FCALL s->ctx [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] FCALL s->server = 0 VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1249] EXPR, FCALL s->version VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->version=0, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 [L1256] EXPR, FCALL s->init_buf VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] FCALL s->state = 4368 [L1283] EXPR, FCALL s->ctx [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect [L1283] FCALL (s->ctx)->stats.sess_connect += 1 [L1284] FCALL s->init_num = 0 VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=12292, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=0, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] FCALL s->state = 4384 [L1301] FCALL s->init_num = 0 [L1302] EXPR, FCALL s->bbio [L1302] EXPR, FCALL s->wbio VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->bbio={0:0}, s->wbio={0:1}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4368, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=1, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=6, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] FCALL s->hit VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->hit=0, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] FCALL s->init_num = 0 VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4384, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={11:-10}, ((s->s3)->tmp.new_cipher)->algorithms=20483, (s->s3)->tmp.new_cipher={20493:0}, blastFlag=2, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=9, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] FCALL s->state = 4416 [L1346] FCALL s->init_num = 0 VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4400, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=3, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] FCALL s->state = 4432 [L1362] FCALL s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4416, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=14, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] FCALL s->state = 4448 [L1385] FCALL s->init_num = 0 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={11:-10}, (s->s3)->tmp.reuse_message=20492, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4432, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={11:-10}, blastFlag=4, buf={20489:20494}, init=1, malloc(sizeof(int))={20487:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20491:0}, state=4448, tmp=0, tmp___0={20487:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 170 locations, 1 error locations. UNSAFE Result, 16.1s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7829 SDtfs, 2707 SDslu, 10361 SDs, 0 SdLazy, 5358 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 70 SyntacticMatches, 46 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred 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, 2634 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3366 NumberOfCodeBlocks, 3366 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3181 ConstructedInterpolants, 0 QuantifiedInterpolants, 722081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 3128/3128 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:49,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:49,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:49,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:49,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:49,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:49,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:49,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:49,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:49,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:49,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:49,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:49,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:49,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:49,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:49,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:49,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:49,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:49,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:49,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:49,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:49,545 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:49,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:49,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:49,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:49,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:49,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:49,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:49,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:49,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:49,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:49,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:49,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:49,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:49,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:49,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:49,553 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 08:34:49,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:49,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:49,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:34:49,564 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:34:49,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:49,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:49,565 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:49,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:49,565 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:49,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:34:49,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:49,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:34:49,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:34:49,568 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 08:34:49,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:34:49,568 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 08:34:49,568 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 08:34:49,568 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_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-18 08:34:49,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:49,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:49,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:49,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:49,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:49,613 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-18 08:34:49,656 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/3154f21f3/cac1ebb7c280413d8cf3af845bc9f4b1/FLAG0f324770f [2018-11-18 08:34:50,039 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:50,040 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-18 08:34:50,050 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/3154f21f3/cac1ebb7c280413d8cf3af845bc9f4b1/FLAG0f324770f [2018-11-18 08:34:50,414 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/data/3154f21f3/cac1ebb7c280413d8cf3af845bc9f4b1 [2018-11-18 08:34:50,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:50,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:34:50,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:50,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:50,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:50,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310fa933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50, skipping insertion in model container [2018-11-18 08:34:50,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:50,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:50,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:50,903 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:51,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:51,160 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:51,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51 WrapperNode [2018-11-18 08:34:51,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:51,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:51,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:51,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:51,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... [2018-11-18 08:34:51,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:51,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:51,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:51,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:51,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-18 08:34:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 08:34:51,280 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-18 08:34:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 08:34:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 08:34:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 08:34:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:34:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 08:34:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:53,625 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 08:34:53,626 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 08:34:54,147 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:54,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54 BoogieIcfgContainer [2018-11-18 08:34:54,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:54,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:34:54,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:34:54,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:34:54,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:50" (1/3) ... [2018-11-18 08:34:54,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac7214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:54, skipping insertion in model container [2018-11-18 08:34:54,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:51" (2/3) ... [2018-11-18 08:34:54,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac7214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:54, skipping insertion in model container [2018-11-18 08:34:54,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54" (3/3) ... [2018-11-18 08:34:54,153 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-18 08:34:54,159 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:34:54,164 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:34:54,173 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:34:54,193 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:54,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:34:54,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:34:54,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:34:54,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:54,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:54,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:34:54,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:54,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:34:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-18 08:34:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:34:54,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:54,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:54,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1476026048, now seen corresponding path program 1 times [2018-11-18 08:34:54,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:54,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:54,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:54,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,370 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-18 08:34:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,458 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-18 08:34:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:34:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:54,470 INFO L225 Difference]: With dead ends: 388 [2018-11-18 08:34:54,470 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 08:34:54,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 08:34:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-18 08:34:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 08:34:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-18 08:34:54,514 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-18 08:34:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:54,514 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-18 08:34:54,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-18 08:34:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 08:34:54,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:54,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:54,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1996210292, now seen corresponding path program 1 times [2018-11-18 08:34:54,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:54,518 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:54,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:54,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,609 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-18 08:34:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,665 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-18 08:34:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 08:34:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:54,668 INFO L225 Difference]: With dead ends: 436 [2018-11-18 08:34:54,668 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 08:34:54,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 08:34:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-18 08:34:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 08:34:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-18 08:34:54,691 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-18 08:34:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:54,691 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-18 08:34:54,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-18 08:34:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 08:34:54,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:54,695 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,695 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:54,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1585213589, now seen corresponding path program 1 times [2018-11-18 08:34:54,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 08:34:54,789 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,792 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-11-18 08:34:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,838 INFO L93 Difference]: Finished difference Result 644 states and 949 transitions. [2018-11-18 08:34:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 08:34:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:54,841 INFO L225 Difference]: With dead ends: 644 [2018-11-18 08:34:54,841 INFO L226 Difference]: Without dead ends: 433 [2018-11-18 08:34:54,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-18 08:34:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-11-18 08:34:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-18 08:34:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 632 transitions. [2018-11-18 08:34:54,859 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 632 transitions. Word has length 66 [2018-11-18 08:34:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:54,860 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 632 transitions. [2018-11-18 08:34:54,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 632 transitions. [2018-11-18 08:34:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 08:34:54,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:54,863 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,864 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:54,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash -973972692, now seen corresponding path program 1 times [2018-11-18 08:34:54,866 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 08:34:54,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:54,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,981 INFO L87 Difference]: Start difference. First operand 433 states and 632 transitions. Second operand 3 states. [2018-11-18 08:34:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,044 INFO L93 Difference]: Finished difference Result 853 states and 1254 transitions. [2018-11-18 08:34:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:55,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-18 08:34:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:55,046 INFO L225 Difference]: With dead ends: 853 [2018-11-18 08:34:55,046 INFO L226 Difference]: Without dead ends: 537 [2018-11-18 08:34:55,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-18 08:34:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-11-18 08:34:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-18 08:34:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 784 transitions. [2018-11-18 08:34:55,060 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 784 transitions. Word has length 87 [2018-11-18 08:34:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:55,061 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 784 transitions. [2018-11-18 08:34:55,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 784 transitions. [2018-11-18 08:34:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 08:34:55,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:55,063 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:55,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:55,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1066978257, now seen corresponding path program 1 times [2018-11-18 08:34:55,064 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:55,065 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:55,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:55,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:55,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:55,173 INFO L87 Difference]: Start difference. First operand 537 states and 784 transitions. Second operand 3 states. [2018-11-18 08:34:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,215 INFO L93 Difference]: Finished difference Result 954 states and 1396 transitions. [2018-11-18 08:34:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:55,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-18 08:34:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:55,217 INFO L225 Difference]: With dead ends: 954 [2018-11-18 08:34:55,217 INFO L226 Difference]: Without dead ends: 534 [2018-11-18 08:34:55,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-18 08:34:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-11-18 08:34:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-18 08:34:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 774 transitions. [2018-11-18 08:34:55,228 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 774 transitions. Word has length 109 [2018-11-18 08:34:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:55,229 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 774 transitions. [2018-11-18 08:34:55,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 774 transitions. [2018-11-18 08:34:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 08:34:55,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:55,230 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:55,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 989867658, now seen corresponding path program 1 times [2018-11-18 08:34:55,231 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:55,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 08:34:55,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 08:34:55,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:55,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 08:34:55,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,665 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-18 08:34:55,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 08:34:55,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:55,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-18 08:34:55,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:55,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 08:34:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:55,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:55,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:55,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:34:55,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:34:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:55,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:55,745 INFO L87 Difference]: Start difference. First operand 534 states and 774 transitions. Second operand 7 states. [2018-11-18 08:34:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:56,980 INFO L93 Difference]: Finished difference Result 1425 states and 2074 transitions. [2018-11-18 08:34:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:56,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-18 08:34:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:56,983 INFO L225 Difference]: With dead ends: 1425 [2018-11-18 08:34:56,984 INFO L226 Difference]: Without dead ends: 904 [2018-11-18 08:34:56,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:34:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-18 08:34:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 642. [2018-11-18 08:34:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-18 08:34:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 962 transitions. [2018-11-18 08:34:57,002 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 962 transitions. Word has length 111 [2018-11-18 08:34:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:57,002 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 962 transitions. [2018-11-18 08:34:57,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:34:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 962 transitions. [2018-11-18 08:34:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 08:34:57,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:57,003 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:57,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:57,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash 616649242, now seen corresponding path program 1 times [2018-11-18 08:34:57,004 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:34:57,004 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:34:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:57,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:57,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 08:34:57,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 08:34:57,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:57,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:57,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 08:34:57,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,434 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-18 08:34:57,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 08:34:57,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:57,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-18 08:34:57,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:57,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 08:34:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:34:57,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:34:57,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:57,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:34:57,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:34:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:57,482 INFO L87 Difference]: Start difference. First operand 642 states and 962 transitions. Second operand 7 states. [2018-11-18 08:35:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,760 INFO L93 Difference]: Finished difference Result 1517 states and 2240 transitions. [2018-11-18 08:35:00,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:35:00,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-11-18 08:35:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,767 INFO L225 Difference]: With dead ends: 1517 [2018-11-18 08:35:00,767 INFO L226 Difference]: Without dead ends: 888 [2018-11-18 08:35:00,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:35:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-18 08:35:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 646. [2018-11-18 08:35:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 08:35:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 966 transitions. [2018-11-18 08:35:00,788 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 966 transitions. Word has length 112 [2018-11-18 08:35:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,788 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 966 transitions. [2018-11-18 08:35:00,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:35:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 966 transitions. [2018-11-18 08:35:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 08:35:00,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,789 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1088194979, now seen corresponding path program 1 times [2018-11-18 08:35:00,790 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:35:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:35:00,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:01,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 08:35:01,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 08:35:01,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:01,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 08:35:01,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 08:35:01,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 08:35:01,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:01,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 08:35:01,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:01,148 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:40, output treesize:13 [2018-11-18 08:35:01,374 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-11-18 08:35:01,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 139 [2018-11-18 08:35:01,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-11-18 08:35:01,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:03,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:03,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 130 [2018-11-18 08:35:03,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:05,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 90 [2018-11-18 08:35:05,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-11-18 08:35:05,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:05,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-18 08:35:05,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-11-18 08:35:05,309 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:05,317 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:05,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:05,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:05,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 138 [2018-11-18 08:35:06,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 126 [2018-11-18 08:35:06,027 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-11-18 08:35:06,560 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:06,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-18 08:35:06,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:06,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-11-18 08:35:06,930 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:06,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:07,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 93 [2018-11-18 08:35:07,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:35:07,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,269 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 201 [2018-11-18 08:35:07,270 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:07,299 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:07,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 90 [2018-11-18 08:35:07,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,428 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,523 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 141 [2018-11-18 08:35:07,524 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:35:07,563 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:07,589 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:35:07,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 110 [2018-11-18 08:35:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:07,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 62 [2018-11-18 08:35:07,785 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-11-18 08:35:08,216 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-18 08:35:08,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-11-18 08:35:08,589 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,596 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-18 08:35:08,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 08:35:08,750 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,755 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,771 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:08,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-18 08:35:08,822 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-18 08:35:08,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:35:08,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-18 08:35:08,829 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,841 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-18 08:35:08,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-18 08:35:08,870 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:08,879 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:08,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:35:08,906 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 3 variables, input treesize:180, output treesize:60 [2018-11-18 08:35:08,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 08:35:08,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:08,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-18 08:35:08,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:08,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:09,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:09,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-18 08:35:09,054 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-11-18 08:35:09,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 08:35:09,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,071 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:1 [2018-11-18 08:35:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 08:35:09,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:35:09,210 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:09,210 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 1 variables, input treesize:95, output treesize:1 [2018-11-18 08:35:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 08:35:09,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:35:09,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-11-18 08:35:09,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 08:35:09,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:35:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:35:09,223 INFO L87 Difference]: Start difference. First operand 646 states and 966 transitions. Second operand 8 states. [2018-11-18 08:35:20,962 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-18 08:35:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:22,445 INFO L93 Difference]: Finished difference Result 3282 states and 4885 transitions. [2018-11-18 08:35:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:35:22,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-11-18 08:35:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:22,446 INFO L225 Difference]: With dead ends: 3282 [2018-11-18 08:35:22,446 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 08:35:22,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-18 08:35:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 08:35:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 08:35:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 08:35:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 08:35:22,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2018-11-18 08:35:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:22,451 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:22,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 08:35:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:35:22,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 08:35:22,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 08:35:22,563 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-11-18 08:35:23,049 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-11-18 08:35:23,165 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-11-18 08:35:23,268 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2018-11-18 08:35:24,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point ssl3_get_client_methodENTRY(lines 1025 1038) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point ssl3_get_client_methodEXIT(lines 1025 1038) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point ssl3_get_client_methodFINAL(lines 1025 1038) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1031(line 1031) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1031-1(line 1031) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1029(lines 1029 1036) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1423(lines 1423 1427) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1390(lines 1390 1394) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1258(lines 1258 1263) no Hoare annotation was computed. [2018-11-18 08:35:24,196 INFO L425 ceAbstractionStarter]: For program point L1490(lines 1490 1501) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1490-1(lines 1490 1501) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L421 ceAbstractionStarter]: At program point L1391(lines 1099 1646) the Hoare annotation is: (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) ssl3_connect_~s.offset)) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32))))) [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1226(lines 1226 1572) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1193(lines 1193 1583) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1594) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L421 ceAbstractionStarter]: At program point L1227(lines 1226 1572) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,197 INFO L421 ceAbstractionStarter]: At program point L1194(lines 1184 1586) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1558(lines 1558 1562) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1525(lines 1525 1530) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1492(lines 1492 1498) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1460(lines 1460 1464) no Hoare annotation was computed. [2018-11-18 08:35:24,197 INFO L425 ceAbstractionStarter]: For program point L1460-2(lines 1460 1464) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1229(lines 1229 1571) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1196(lines 1196 1582) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1163(lines 1163 1593) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1130(lines 1130 1634) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1130-2(lines 1099 1646) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1395(lines 1395 1399) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L428 ceAbstractionStarter]: At program point L1230(lines 1229 1571) the Hoare annotation is: true [2018-11-18 08:35:24,198 INFO L421 ceAbstractionStarter]: At program point L1164(lines 1160 1594) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1131(line 1131) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1429(lines 1429 1434) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1429-2(lines 1429 1434) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1330(lines 1330 1344) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1330-2(lines 1330 1344) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1364(lines 1364 1369) no Hoare annotation was computed. [2018-11-18 08:35:24,198 INFO L425 ceAbstractionStarter]: For program point L1199(lines 1199 1581) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1166(lines 1166 1592) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1133(lines 1133 1603) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L428 ceAbstractionStarter]: At program point L1233(lines 1232 1570) the Hoare annotation is: true [2018-11-18 08:35:24,199 INFO L421 ceAbstractionStarter]: At program point L1200(lines 1196 1582) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,199 INFO L421 ceAbstractionStarter]: At program point L1134(lines 1133 1603) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1471) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1400(lines 1400 1404) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1400-2(lines 1400 1404) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1334-2(lines 1332 1344) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1202(lines 1202 1580) no Hoare annotation was computed. [2018-11-18 08:35:24,199 INFO L425 ceAbstractionStarter]: For program point L1169(lines 1169 1591) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1136(lines 1136 1602) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1302(lines 1302 1306) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1269(lines 1269 1274) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L421 ceAbstractionStarter]: At program point L1170(lines 1166 1592) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,200 INFO L421 ceAbstractionStarter]: At program point L1568(lines 1234 1569) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1205(lines 1205 1579) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1590) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L425 ceAbstractionStarter]: For program point L1139(lines 1139 1601) no Hoare annotation was computed. [2018-11-18 08:35:24,200 INFO L428 ceAbstractionStarter]: At program point L1635(lines 1129 1636) the Hoare annotation is: true [2018-11-18 08:35:24,200 INFO L421 ceAbstractionStarter]: At program point L1239(lines 1136 1602) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,200 INFO L421 ceAbstractionStarter]: At program point L1206(lines 1202 1580) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,201 INFO L421 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 1076 1647) the Hoare annotation is: (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ssl3_connect_#in~s.base|) (_ bv204 32))) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32))))) [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1604(lines 1604 1632) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1604-1(lines 1604 1632) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1538(lines 1538 1542) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1538-2(lines 1538 1542) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1208(lines 1208 1578) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1175(lines 1175 1589) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1142(lines 1142 1600) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1605(lines 1605 1629) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1473(lines 1473 1478) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1440(lines 1440 1444) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1374(lines 1374 1378) no Hoare annotation was computed. [2018-11-18 08:35:24,201 INFO L421 ceAbstractionStarter]: At program point L1176(lines 1172 1590) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,201 INFO L425 ceAbstractionStarter]: For program point L1110(lines 1110 1118) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1639(lines 1639 1643) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1606(lines 1606 1615) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1639-2(lines 1639 1643) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1606-2(lines 1605 1627) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1507(lines 1507 1511) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1276(lines 1276 1281) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1645) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1244(lines 1244 1248) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1211(lines 1211 1577) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1178(lines 1178 1588) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1244-2(lines 1244 1248) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1145(lines 1145 1599) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point L1608(lines 1608 1612) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 1234 1569) no Hoare annotation was computed. [2018-11-18 08:35:24,202 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 1234 1569) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1311(lines 1311 1315) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1311-2(lines 1234 1567) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L421 ceAbstractionStarter]: At program point L1212(lines 1208 1578) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1113(lines 1113 1117) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1113-2(lines 1110 1118) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1543(lines 1543 1547) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1543-2(lines 1543 1547) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1412(lines 1412 1416) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1379(lines 1379 1383) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1214(lines 1214 1576) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1181(lines 1181 1587) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1148(lines 1148 1598) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1512(lines 1512 1516) no Hoare annotation was computed. [2018-11-18 08:35:24,203 INFO L425 ceAbstractionStarter]: For program point L1512-2(lines 1512 1516) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L421 ceAbstractionStarter]: At program point L1182(lines 1178 1588) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 1076 1647) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 1076 1647) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1217(lines 1217 1575) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1184(lines 1184 1586) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1151(lines 1151 1597) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L421 ceAbstractionStarter]: At program point L1218(lines 1214 1576) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,204 INFO L421 ceAbstractionStarter]: At program point L1152(lines 1148 1598) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1483(lines 1483 1487) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1351(lines 1351 1355) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1351-2(lines 1234 1567) no Hoare annotation was computed. [2018-11-18 08:35:24,204 INFO L425 ceAbstractionStarter]: For program point L1120(lines 1120 1128) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1550(lines 1550 1554) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1550-2(lines 1550 1554) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1220(lines 1220 1574) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1187(lines 1187 1585) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1154(lines 1154 1596) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1617(lines 1617 1623) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1452(lines 1452 1456) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1325) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1321-2(lines 1321 1325) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1256(lines 1256 1267) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1223(lines 1223 1573) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1584) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1256-2(lines 1256 1267) no Hoare annotation was computed. [2018-11-18 08:35:24,205 INFO L425 ceAbstractionStarter]: For program point L1157(lines 1157 1595) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point L1521(lines 1521 1534) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point L1521-2(lines 1521 1534) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L421 ceAbstractionStarter]: At program point L1224(lines 1220 1574) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point L1290-2(lines 1234 1567) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L421 ceAbstractionStarter]: At program point L1158(lines 1154 1596) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ssl3_connect_~s.offset))) (or (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (not (= |ssl3_connect_#in~s.offset| (_ bv0 32))) (and (= (bvadd ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| |ssl3_connect_#in~s.base|) (_ bv204 32)))))) [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 08:35:24,206 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyENTRY(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,206 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L421 ceAbstractionStarter]: At program point L1071(line 1071) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv204 32))) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32))) [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point L1071-1(line 1071) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 1061 1075) the Hoare annotation is: true [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 1061 1075) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1061 1075) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point sslv3_base_methodENTRY(lines 1650 1658) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point sslv3_base_methodFINAL(lines 1650 1658) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point L1655(line 1655) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point sslv3_base_methodEXIT(lines 1650 1658) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitENTRY(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point SSLv3_client_methodENTRY(lines 1041 1060) no Hoare annotation was computed. [2018-11-18 08:35:24,207 INFO L425 ceAbstractionStarter]: For program point SSLv3_client_methodEXIT(lines 1041 1060) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1051(line 1051) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1051-1(line 1051) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1049(line 1049) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1049-1(line 1049) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1046(lines 1046 1057) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point L1046-2(lines 1046 1057) no Hoare annotation was computed. [2018-11-18 08:35:24,208 INFO L425 ceAbstractionStarter]: For program point SSLv3_client_methodFINAL(lines 1041 1060) no Hoare annotation was computed. [2018-11-18 08:35:24,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,222 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,223 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,223 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,224 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,225 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,225 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,226 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,227 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,227 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,228 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,232 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,233 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,233 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,234 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,234 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,235 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,236 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,236 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,238 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,238 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:35:24 BoogieIcfgContainer [2018-11-18 08:35:24,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:35:24,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:24,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:24,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:24,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54" (3/4) ... [2018-11-18 08:35:24,250 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 08:35:24,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 08:35:24,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_get_client_method [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sslv3_base_method [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-18 08:35:24,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure SSLv3_client_method [2018-11-18 08:35:24,264 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2018-11-18 08:35:24,264 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-18 08:35:24,265 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 08:35:24,265 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 08:35:24,266 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 08:35:24,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 08:35:24,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,286 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,287 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s) || !(s == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,288 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,290 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) [2018-11-18 08:35:24,337 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_808cfeef-9a4a-42ee-b1de-ea632d88114e/bin-2019/uautomizer/witness.graphml [2018-11-18 08:35:24,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:24,338 INFO L168 Benchmark]: Toolchain (without parser) took 33921.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 946.5 MB in the beginning and 942.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 319.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,338 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:24,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,339 INFO L168 Benchmark]: Boogie Preprocessor took 74.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,339 INFO L168 Benchmark]: RCFGBuilder took 2911.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,339 INFO L168 Benchmark]: TraceAbstraction took 30095.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 977.9 MB in the beginning and 959.7 MB in the end (delta: 18.2 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,339 INFO L168 Benchmark]: Witness Printer took 93.48 ms. Allocated memory is still 1.3 GB. Free memory was 959.7 MB in the beginning and 942.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:24,342 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 742.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2911.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30095.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 977.9 MB in the beginning and 959.7 MB in the end (delta: 18.2 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. * Witness Printer took 93.48 ms. Allocated memory is still 1.3 GB. Free memory was 959.7 MB in the beginning and 942.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1645]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1202]: Loop Invariant [2018-11-18 08:35:24,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1234]: Loop Invariant [2018-11-18 08:35:24,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1160]: Loop Invariant [2018-11-18 08:35:24,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1136]: Loop Invariant [2018-11-18 08:35:24,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1184]: Loop Invariant [2018-11-18 08:35:24,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,351 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1148]: Loop Invariant [2018-11-18 08:35:24,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,351 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1226]: Loop Invariant [2018-11-18 08:35:24,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1133]: Loop Invariant [2018-11-18 08:35:24,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1099]: Loop Invariant [2018-11-18 08:35:24,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s) || !(s == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1214]: Loop Invariant [2018-11-18 08:35:24,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1172]: Loop Invariant [2018-11-18 08:35:24,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1154]: Loop Invariant [2018-11-18 08:35:24,357 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,357 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1232]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1208]: Loop Invariant [2018-11-18 08:35:24,358 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,358 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1196]: Loop Invariant [2018-11-18 08:35:24,359 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,359 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1178]: Loop Invariant [2018-11-18 08:35:24,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1166]: Loop Invariant [2018-11-18 08:35:24,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - InvariantResult [Line: 1220]: Loop Invariant [2018-11-18 08:35:24,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 08:35:24,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 08:35:24,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967292bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || !(s == 0bv32)) || (~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s)) || !(0bv32 == \old(#memory_$Pointer$)[s][204bv32]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 170 locations, 1 error locations. SAFE Result, 30.0s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1992 SDtfs, 2256 SDslu, 2391 SDs, 0 SdLazy, 1924 SolverSat, 208 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=7, 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 504 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 445 NumberOfFragments, 958 HoareAnnotationTreeSize, 26 FomulaSimplifications, 44633 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1899 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 808 ConstructedInterpolants, 21 QuantifiedInterpolants, 555339 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 752/816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...