./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 734374bd08e5d81d02921a162508af5871b3609e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 734374bd08e5d81d02921a162508af5871b3609e .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 03:08:48,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:08:48,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:08:48,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:08:48,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:08:48,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:08:48,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:08:48,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:08:48,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:08:48,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:08:48,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:08:48,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:08:48,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:08:48,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:08:48,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:08:48,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:08:48,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:08:48,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:08:48,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:08:48,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:08:48,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:08:48,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:08:48,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:08:48,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:08:48,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:08:48,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:08:48,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:08:48,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:08:48,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:08:48,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:08:48,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:08:48,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:08:48,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:08:48,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:08:48,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:08:48,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:08:48,339 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 03:08:48,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:08:48,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:08:48,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:08:48,347 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:08:48,347 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:08:48,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:08:48,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:08:48,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:08:48,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:08:48,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 03:08:48,350 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 734374bd08e5d81d02921a162508af5871b3609e [2018-12-09 03:08:48,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:08:48,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:08:48,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:08:48,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:08:48,377 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:08:48,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-09 03:08:48,413 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/a2a9e8611/2109b3805bd542b0a489f9bea363bb89/FLAGa94a52dc7 [2018-12-09 03:08:48,879 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:08:48,880 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-09 03:08:48,891 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/a2a9e8611/2109b3805bd542b0a489f9bea363bb89/FLAGa94a52dc7 [2018-12-09 03:08:49,398 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/a2a9e8611/2109b3805bd542b0a489f9bea363bb89 [2018-12-09 03:08:49,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:08:49,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:08:49,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:08:49,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:08:49,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:08:49,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7240a955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49, skipping insertion in model container [2018-12-09 03:08:49,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:08:49,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:08:49,687 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:08:49,698 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:08:49,762 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:08:49,773 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:08:49,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49 WrapperNode [2018-12-09 03:08:49,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:08:49,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:08:49,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:08:49,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:08:49,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:08:49,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:08:49,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:08:49,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:08:49,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... [2018-12-09 03:08:49,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:08:49,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:08:49,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:08:49,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:08:49,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:08:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 03:08:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 03:08:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 03:08:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 03:08:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 03:08:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 03:08:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 03:08:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:08:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:08:50,083 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 03:08:50,084 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 03:08:50,420 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:08:50,420 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 03:08:50,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:08:50 BoogieIcfgContainer [2018-12-09 03:08:50,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:08:50,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 03:08:50,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 03:08:50,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 03:08:50,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:08:49" (1/3) ... [2018-12-09 03:08:50,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6538630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:08:50, skipping insertion in model container [2018-12-09 03:08:50,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:49" (2/3) ... [2018-12-09 03:08:50,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6538630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:08:50, skipping insertion in model container [2018-12-09 03:08:50,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:08:50" (3/3) ... [2018-12-09 03:08:50,426 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-09 03:08:50,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 03:08:50,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 03:08:50,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 03:08:50,464 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 03:08:50,464 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 03:08:50,464 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 03:08:50,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:08:50,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:08:50,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 03:08:50,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:08:50,465 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 03:08:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-12-09 03:08:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 03:08:50,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:50,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:50,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:50,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -159093021, now seen corresponding path program 1 times [2018-12-09 03:08:50,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:50,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:50,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:50,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:50,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:50,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:50,692 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2018-12-09 03:08:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:50,953 INFO L93 Difference]: Finished difference Result 323 states and 538 transitions. [2018-12-09 03:08:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:50,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 03:08:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:50,962 INFO L225 Difference]: With dead ends: 323 [2018-12-09 03:08:50,962 INFO L226 Difference]: Without dead ends: 164 [2018-12-09 03:08:50,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-09 03:08:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-12-09 03:08:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 03:08:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2018-12-09 03:08:50,993 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2018-12-09 03:08:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:50,994 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2018-12-09 03:08:50,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-12-09 03:08:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 03:08:50,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:50,995 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:50,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1249544262, now seen corresponding path program 1 times [2018-12-09 03:08:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:50,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:50,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:51,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:51,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:51,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:51,066 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2018-12-09 03:08:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:51,246 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2018-12-09 03:08:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:51,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 03:08:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:51,247 INFO L225 Difference]: With dead ends: 286 [2018-12-09 03:08:51,247 INFO L226 Difference]: Without dead ends: 164 [2018-12-09 03:08:51,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-09 03:08:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-12-09 03:08:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 03:08:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2018-12-09 03:08:51,254 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2018-12-09 03:08:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:51,255 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2018-12-09 03:08:51,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2018-12-09 03:08:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 03:08:51,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:51,256 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:51,256 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:51,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2088335094, now seen corresponding path program 1 times [2018-12-09 03:08:51,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:51,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:51,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:51,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:51,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:51,324 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 5 states. [2018-12-09 03:08:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:51,622 INFO L93 Difference]: Finished difference Result 290 states and 437 transitions. [2018-12-09 03:08:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:08:51,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 03:08:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:51,624 INFO L225 Difference]: With dead ends: 290 [2018-12-09 03:08:51,624 INFO L226 Difference]: Without dead ends: 168 [2018-12-09 03:08:51,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-09 03:08:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-12-09 03:08:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 03:08:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2018-12-09 03:08:51,631 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2018-12-09 03:08:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:51,631 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2018-12-09 03:08:51,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2018-12-09 03:08:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 03:08:51,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:51,632 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:51,632 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:51,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash -131916627, now seen corresponding path program 1 times [2018-12-09 03:08:51,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:51,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:51,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:51,701 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2018-12-09 03:08:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:51,862 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2018-12-09 03:08:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:51,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 03:08:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:51,864 INFO L225 Difference]: With dead ends: 323 [2018-12-09 03:08:51,864 INFO L226 Difference]: Without dead ends: 181 [2018-12-09 03:08:51,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-09 03:08:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2018-12-09 03:08:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 03:08:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2018-12-09 03:08:51,872 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2018-12-09 03:08:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:51,873 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2018-12-09 03:08:51,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2018-12-09 03:08:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 03:08:51,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:51,874 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:51,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:51,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash 368734894, now seen corresponding path program 1 times [2018-12-09 03:08:51,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:51,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:51,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:51,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:51,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:51,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:51,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:51,938 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2018-12-09 03:08:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,078 INFO L93 Difference]: Finished difference Result 322 states and 475 transitions. [2018-12-09 03:08:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 03:08:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,079 INFO L225 Difference]: With dead ends: 322 [2018-12-09 03:08:52,079 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 03:08:52,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 03:08:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-09 03:08:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 03:08:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2018-12-09 03:08:52,084 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2018-12-09 03:08:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:52,084 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2018-12-09 03:08:52,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2018-12-09 03:08:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 03:08:52,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:52,086 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:52,086 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:52,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash -308767357, now seen corresponding path program 1 times [2018-12-09 03:08:52,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:52,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:52,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:52,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:52,123 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2018-12-09 03:08:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,267 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2018-12-09 03:08:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 03:08:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,268 INFO L225 Difference]: With dead ends: 322 [2018-12-09 03:08:52,268 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 03:08:52,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 03:08:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-09 03:08:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 03:08:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2018-12-09 03:08:52,272 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2018-12-09 03:08:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:52,272 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2018-12-09 03:08:52,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2018-12-09 03:08:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:08:52,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:52,273 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:52,273 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:52,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -904921750, now seen corresponding path program 1 times [2018-12-09 03:08:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:52,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:52,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:52,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:52,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:52,312 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2018-12-09 03:08:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,443 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2018-12-09 03:08:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 03:08:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,444 INFO L225 Difference]: With dead ends: 322 [2018-12-09 03:08:52,444 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 03:08:52,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 03:08:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-09 03:08:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 03:08:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2018-12-09 03:08:52,450 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2018-12-09 03:08:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:52,450 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2018-12-09 03:08:52,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2018-12-09 03:08:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 03:08:52,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:52,451 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:52,451 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:52,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1747569565, now seen corresponding path program 1 times [2018-12-09 03:08:52,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:52,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:52,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:52,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:52,490 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2018-12-09 03:08:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,648 INFO L93 Difference]: Finished difference Result 351 states and 519 transitions. [2018-12-09 03:08:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 03:08:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,650 INFO L225 Difference]: With dead ends: 351 [2018-12-09 03:08:52,650 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 03:08:52,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 03:08:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-12-09 03:08:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2018-12-09 03:08:52,654 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 68 [2018-12-09 03:08:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:52,654 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2018-12-09 03:08:52,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2018-12-09 03:08:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 03:08:52,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:52,655 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:52,655 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 886427902, now seen corresponding path program 1 times [2018-12-09 03:08:52,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:52,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:52,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:52,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:52,693 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand 4 states. [2018-12-09 03:08:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,828 INFO L93 Difference]: Finished difference Result 366 states and 546 transitions. [2018-12-09 03:08:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 03:08:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,830 INFO L225 Difference]: With dead ends: 366 [2018-12-09 03:08:52,830 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 03:08:52,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 03:08:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2018-12-09 03:08:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2018-12-09 03:08:52,835 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2018-12-09 03:08:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2018-12-09 03:08:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2018-12-09 03:08:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:52,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:52,835 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:52,836 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:52,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -619008379, now seen corresponding path program 1 times [2018-12-09 03:08:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:52,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:52,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:52,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:52,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:52,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:52,870 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2018-12-09 03:08:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:52,997 INFO L93 Difference]: Finished difference Result 356 states and 533 transitions. [2018-12-09 03:08:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:52,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-09 03:08:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:52,998 INFO L225 Difference]: With dead ends: 356 [2018-12-09 03:08:52,998 INFO L226 Difference]: Without dead ends: 192 [2018-12-09 03:08:52,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-09 03:08:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-12-09 03:08:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2018-12-09 03:08:53,004 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2018-12-09 03:08:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:53,004 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2018-12-09 03:08:53,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2018-12-09 03:08:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 03:08:53,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:53,005 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:53,005 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:53,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1016015308, now seen corresponding path program 1 times [2018-12-09 03:08:53,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:53,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:53,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:53,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:53,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:53,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,055 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2018-12-09 03:08:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:53,215 INFO L93 Difference]: Finished difference Result 373 states and 553 transitions. [2018-12-09 03:08:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:53,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 03:08:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:53,216 INFO L225 Difference]: With dead ends: 373 [2018-12-09 03:08:53,216 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 03:08:53,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 03:08:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-12-09 03:08:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2018-12-09 03:08:53,222 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2018-12-09 03:08:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:53,222 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2018-12-09 03:08:53,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2018-12-09 03:08:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 03:08:53,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:53,223 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:53,223 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1218620391, now seen corresponding path program 1 times [2018-12-09 03:08:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:53,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:53,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,262 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2018-12-09 03:08:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:53,444 INFO L93 Difference]: Finished difference Result 371 states and 549 transitions. [2018-12-09 03:08:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:53,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 03:08:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:53,445 INFO L225 Difference]: With dead ends: 371 [2018-12-09 03:08:53,445 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 03:08:53,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 03:08:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2018-12-09 03:08:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2018-12-09 03:08:53,449 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2018-12-09 03:08:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:53,450 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2018-12-09 03:08:53,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2018-12-09 03:08:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 03:08:53,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:53,451 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:53,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:53,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1719271912, now seen corresponding path program 1 times [2018-12-09 03:08:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:53,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:53,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:53,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:53,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,481 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2018-12-09 03:08:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:53,667 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-09 03:08:53,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:53,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 03:08:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:53,668 INFO L225 Difference]: With dead ends: 370 [2018-12-09 03:08:53,668 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 03:08:53,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 03:08:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-09 03:08:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2018-12-09 03:08:53,673 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2018-12-09 03:08:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:53,674 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2018-12-09 03:08:53,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2018-12-09 03:08:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 03:08:53,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:53,675 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:53,675 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:53,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1391792759, now seen corresponding path program 1 times [2018-12-09 03:08:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:53,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:53,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:53,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:53,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,717 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2018-12-09 03:08:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:53,882 INFO L93 Difference]: Finished difference Result 370 states and 544 transitions. [2018-12-09 03:08:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:53,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 03:08:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:53,884 INFO L225 Difference]: With dead ends: 370 [2018-12-09 03:08:53,884 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 03:08:53,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 03:08:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-09 03:08:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2018-12-09 03:08:53,890 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2018-12-09 03:08:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:53,891 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2018-12-09 03:08:53,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2018-12-09 03:08:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 03:08:53,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:53,892 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:53,892 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:53,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -118970844, now seen corresponding path program 1 times [2018-12-09 03:08:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:53,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:53,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:53,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:53,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:53,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:53,945 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2018-12-09 03:08:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:54,115 INFO L93 Difference]: Finished difference Result 370 states and 542 transitions. [2018-12-09 03:08:54,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:54,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 03:08:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:54,116 INFO L225 Difference]: With dead ends: 370 [2018-12-09 03:08:54,116 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 03:08:54,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 03:08:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-09 03:08:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2018-12-09 03:08:54,122 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2018-12-09 03:08:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:54,123 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2018-12-09 03:08:54,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2018-12-09 03:08:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 03:08:54,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:54,123 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:54,124 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:54,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:54,124 INFO L82 PathProgramCache]: Analyzing trace with hash -518897788, now seen corresponding path program 1 times [2018-12-09 03:08:54,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:54,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:54,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:54,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:54,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:54,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,169 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2018-12-09 03:08:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:54,348 INFO L93 Difference]: Finished difference Result 370 states and 540 transitions. [2018-12-09 03:08:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:54,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-09 03:08:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:54,349 INFO L225 Difference]: With dead ends: 370 [2018-12-09 03:08:54,349 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 03:08:54,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 03:08:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-09 03:08:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2018-12-09 03:08:54,356 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2018-12-09 03:08:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:54,356 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2018-12-09 03:08:54,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2018-12-09 03:08:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 03:08:54,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:54,357 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:54,357 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:54,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1234431809, now seen corresponding path program 1 times [2018-12-09 03:08:54,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:54,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:54,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:54,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:54,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,410 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2018-12-09 03:08:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:54,548 INFO L93 Difference]: Finished difference Result 360 states and 526 transitions. [2018-12-09 03:08:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:54,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 03:08:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:54,549 INFO L225 Difference]: With dead ends: 360 [2018-12-09 03:08:54,549 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 03:08:54,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 03:08:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2018-12-09 03:08:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 03:08:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2018-12-09 03:08:54,554 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2018-12-09 03:08:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:54,554 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2018-12-09 03:08:54,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2018-12-09 03:08:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 03:08:54,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:54,555 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:54,555 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:54,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1816830103, now seen corresponding path program 1 times [2018-12-09 03:08:54,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:54,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:54,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:54,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:54,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:54,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,614 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2018-12-09 03:08:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:54,850 INFO L93 Difference]: Finished difference Result 448 states and 660 transitions. [2018-12-09 03:08:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:54,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 03:08:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:54,852 INFO L225 Difference]: With dead ends: 448 [2018-12-09 03:08:54,852 INFO L226 Difference]: Without dead ends: 284 [2018-12-09 03:08:54,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-09 03:08:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2018-12-09 03:08:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 03:08:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2018-12-09 03:08:54,860 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2018-12-09 03:08:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:54,861 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2018-12-09 03:08:54,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2018-12-09 03:08:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 03:08:54,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:54,862 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:54,862 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:54,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 919436825, now seen corresponding path program 1 times [2018-12-09 03:08:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:54,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:54,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:54,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:54,915 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2018-12-09 03:08:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:55,085 INFO L93 Difference]: Finished difference Result 487 states and 740 transitions. [2018-12-09 03:08:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:55,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 03:08:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:55,086 INFO L225 Difference]: With dead ends: 487 [2018-12-09 03:08:55,086 INFO L226 Difference]: Without dead ends: 280 [2018-12-09 03:08:55,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-09 03:08:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-09 03:08:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2018-12-09 03:08:55,092 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2018-12-09 03:08:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:55,092 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2018-12-09 03:08:55,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2018-12-09 03:08:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 03:08:55,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:55,093 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:55,093 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:55,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 704494354, now seen corresponding path program 1 times [2018-12-09 03:08:55,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:55,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:55,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:55,140 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2018-12-09 03:08:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:55,387 INFO L93 Difference]: Finished difference Result 539 states and 818 transitions. [2018-12-09 03:08:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:55,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 03:08:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:55,388 INFO L225 Difference]: With dead ends: 539 [2018-12-09 03:08:55,388 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 03:08:55,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 03:08:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2018-12-09 03:08:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2018-12-09 03:08:55,394 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2018-12-09 03:08:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:55,394 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2018-12-09 03:08:55,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2018-12-09 03:08:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 03:08:55,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:55,395 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:55,395 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 745169104, now seen corresponding path program 1 times [2018-12-09 03:08:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:55,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:55,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:55,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:55,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:55,450 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2018-12-09 03:08:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:55,618 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2018-12-09 03:08:55,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:55,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 03:08:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:55,619 INFO L225 Difference]: With dead ends: 511 [2018-12-09 03:08:55,619 INFO L226 Difference]: Without dead ends: 280 [2018-12-09 03:08:55,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-09 03:08:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-09 03:08:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2018-12-09 03:08:55,625 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2018-12-09 03:08:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:55,625 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2018-12-09 03:08:55,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2018-12-09 03:08:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:08:55,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:55,626 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:55,626 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:55,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash 151405409, now seen corresponding path program 1 times [2018-12-09 03:08:55,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:55,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:55,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:55,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:55,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:55,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:55,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:55,658 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2018-12-09 03:08:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:55,865 INFO L93 Difference]: Finished difference Result 537 states and 812 transitions. [2018-12-09 03:08:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:55,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:08:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:55,866 INFO L225 Difference]: With dead ends: 537 [2018-12-09 03:08:55,866 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 03:08:55,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 03:08:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 256. [2018-12-09 03:08:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2018-12-09 03:08:55,872 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2018-12-09 03:08:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2018-12-09 03:08:55,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2018-12-09 03:08:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:08:55,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:55,873 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:55,873 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:55,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 652056930, now seen corresponding path program 1 times [2018-12-09 03:08:55,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:55,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:55,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:55,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:55,904 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2018-12-09 03:08:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:56,101 INFO L93 Difference]: Finished difference Result 536 states and 809 transitions. [2018-12-09 03:08:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:56,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:08:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:56,102 INFO L225 Difference]: With dead ends: 536 [2018-12-09 03:08:56,102 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:08:56,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:08:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-09 03:08:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2018-12-09 03:08:56,107 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2018-12-09 03:08:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:56,107 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2018-12-09 03:08:56,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2018-12-09 03:08:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:08:56,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:56,108 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:56,108 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:56,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1412322659, now seen corresponding path program 1 times [2018-12-09 03:08:56,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:56,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:56,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:56,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:56,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:56,139 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2018-12-09 03:08:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:56,311 INFO L93 Difference]: Finished difference Result 509 states and 770 transitions. [2018-12-09 03:08:56,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:56,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:08:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:56,313 INFO L225 Difference]: With dead ends: 509 [2018-12-09 03:08:56,313 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 03:08:56,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 03:08:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2018-12-09 03:08:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2018-12-09 03:08:56,321 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2018-12-09 03:08:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:56,321 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2018-12-09 03:08:56,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2018-12-09 03:08:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:08:56,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:56,322 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:56,323 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:56,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1912974180, now seen corresponding path program 1 times [2018-12-09 03:08:56,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:56,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:56,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:56,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:56,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:56,376 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2018-12-09 03:08:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:56,535 INFO L93 Difference]: Finished difference Result 508 states and 767 transitions. [2018-12-09 03:08:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:56,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:08:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:56,536 INFO L225 Difference]: With dead ends: 508 [2018-12-09 03:08:56,536 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 03:08:56,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 03:08:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-09 03:08:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2018-12-09 03:08:56,545 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2018-12-09 03:08:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:56,545 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2018-12-09 03:08:56,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2018-12-09 03:08:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 03:08:56,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:56,546 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:56,547 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:56,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash -115718833, now seen corresponding path program 1 times [2018-12-09 03:08:56,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:56,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:56,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:56,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:56,581 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2018-12-09 03:08:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:56,779 INFO L93 Difference]: Finished difference Result 536 states and 803 transitions. [2018-12-09 03:08:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:56,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-09 03:08:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:56,780 INFO L225 Difference]: With dead ends: 536 [2018-12-09 03:08:56,780 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:08:56,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:08:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-09 03:08:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2018-12-09 03:08:56,788 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2018-12-09 03:08:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:56,789 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2018-12-09 03:08:56,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2018-12-09 03:08:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 03:08:56,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:56,790 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:56,790 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:56,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 318010253, now seen corresponding path program 1 times [2018-12-09 03:08:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:56,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:56,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:56,825 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2018-12-09 03:08:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:56,978 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2018-12-09 03:08:56,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:56,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-09 03:08:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:56,979 INFO L225 Difference]: With dead ends: 508 [2018-12-09 03:08:56,979 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 03:08:56,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 03:08:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-09 03:08:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2018-12-09 03:08:56,985 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2018-12-09 03:08:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:56,985 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2018-12-09 03:08:56,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2018-12-09 03:08:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 03:08:56,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:56,986 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:56,986 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:56,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 784615198, now seen corresponding path program 1 times [2018-12-09 03:08:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:56,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:56,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:57,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:57,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:57,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:57,017 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2018-12-09 03:08:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:57,215 INFO L93 Difference]: Finished difference Result 536 states and 799 transitions. [2018-12-09 03:08:57,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:57,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-09 03:08:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:57,216 INFO L225 Difference]: With dead ends: 536 [2018-12-09 03:08:57,216 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:08:57,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:08:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-09 03:08:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2018-12-09 03:08:57,222 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2018-12-09 03:08:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:57,222 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2018-12-09 03:08:57,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2018-12-09 03:08:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 03:08:57,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:57,223 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:57,223 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:57,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1345314976, now seen corresponding path program 1 times [2018-12-09 03:08:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:57,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:57,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:57,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:57,252 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2018-12-09 03:08:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:57,400 INFO L93 Difference]: Finished difference Result 508 states and 759 transitions. [2018-12-09 03:08:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:57,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-09 03:08:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:57,401 INFO L225 Difference]: With dead ends: 508 [2018-12-09 03:08:57,401 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 03:08:57,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 03:08:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-09 03:08:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2018-12-09 03:08:57,407 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2018-12-09 03:08:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:57,407 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2018-12-09 03:08:57,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2018-12-09 03:08:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 03:08:57,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:57,408 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:57,408 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:57,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1722465738, now seen corresponding path program 1 times [2018-12-09 03:08:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:57,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:57,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:57,440 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2018-12-09 03:08:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:57,639 INFO L93 Difference]: Finished difference Result 536 states and 795 transitions. [2018-12-09 03:08:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:57,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 03:08:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:57,640 INFO L225 Difference]: With dead ends: 536 [2018-12-09 03:08:57,640 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:08:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:08:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-09 03:08:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2018-12-09 03:08:57,646 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2018-12-09 03:08:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:57,646 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2018-12-09 03:08:57,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2018-12-09 03:08:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 03:08:57,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:57,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:57,647 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:57,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1924289672, now seen corresponding path program 1 times [2018-12-09 03:08:57,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:57,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:57,679 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2018-12-09 03:08:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:57,823 INFO L93 Difference]: Finished difference Result 508 states and 755 transitions. [2018-12-09 03:08:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:57,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 03:08:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:57,825 INFO L225 Difference]: With dead ends: 508 [2018-12-09 03:08:57,825 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 03:08:57,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 03:08:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-09 03:08:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2018-12-09 03:08:57,835 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2018-12-09 03:08:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:57,836 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2018-12-09 03:08:57,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2018-12-09 03:08:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 03:08:57,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:57,837 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:57,837 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:57,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash -471639239, now seen corresponding path program 1 times [2018-12-09 03:08:57,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:57,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:57,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:57,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:57,876 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2018-12-09 03:08:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:58,061 INFO L93 Difference]: Finished difference Result 526 states and 779 transitions. [2018-12-09 03:08:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:58,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 03:08:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:58,062 INFO L225 Difference]: With dead ends: 526 [2018-12-09 03:08:58,062 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 03:08:58,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 03:08:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2018-12-09 03:08:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2018-12-09 03:08:58,068 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2018-12-09 03:08:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:58,068 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2018-12-09 03:08:58,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2018-12-09 03:08:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 03:08:58,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:58,069 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:58,069 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:58,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1489935419, now seen corresponding path program 1 times [2018-12-09 03:08:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:58,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:58,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:58,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:58,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:58,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:58,115 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2018-12-09 03:08:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:58,251 INFO L93 Difference]: Finished difference Result 498 states and 739 transitions. [2018-12-09 03:08:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:58,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 03:08:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:58,252 INFO L225 Difference]: With dead ends: 498 [2018-12-09 03:08:58,252 INFO L226 Difference]: Without dead ends: 267 [2018-12-09 03:08:58,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-09 03:08:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-09 03:08:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2018-12-09 03:08:58,260 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2018-12-09 03:08:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:58,260 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2018-12-09 03:08:58,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2018-12-09 03:08:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 03:08:58,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:58,261 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:58,261 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:58,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1835731803, now seen corresponding path program 1 times [2018-12-09 03:08:58,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 03:08:58,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:58,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:58,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:58,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:58,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:58,312 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2018-12-09 03:08:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:58,517 INFO L93 Difference]: Finished difference Result 526 states and 775 transitions. [2018-12-09 03:08:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:58,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-09 03:08:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:58,518 INFO L225 Difference]: With dead ends: 526 [2018-12-09 03:08:58,518 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 03:08:58,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 03:08:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2018-12-09 03:08:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:08:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2018-12-09 03:08:58,525 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2018-12-09 03:08:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:58,525 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2018-12-09 03:08:58,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2018-12-09 03:08:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 03:08:58,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:58,526 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:58,526 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:58,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash 773055655, now seen corresponding path program 1 times [2018-12-09 03:08:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 03:08:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:58,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:58,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:58,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:58,558 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2018-12-09 03:08:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:58,599 INFO L93 Difference]: Finished difference Result 716 states and 1065 transitions. [2018-12-09 03:08:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:58,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-09 03:08:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:58,600 INFO L225 Difference]: With dead ends: 716 [2018-12-09 03:08:58,600 INFO L226 Difference]: Without dead ends: 485 [2018-12-09 03:08:58,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-09 03:08:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2018-12-09 03:08:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-12-09 03:08:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2018-12-09 03:08:58,614 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2018-12-09 03:08:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:58,614 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2018-12-09 03:08:58,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2018-12-09 03:08:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 03:08:58,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:58,615 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-09 03:08:58,615 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:58,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1053667786, now seen corresponding path program 1 times [2018-12-09 03:08:58,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:58,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:58,708 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 03:08:58,740 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 03:08:58,741 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24586 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 03:08:58,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:08:58 BoogieIcfgContainer [2018-12-09 03:08:58,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 03:08:58,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:08:58,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:08:58,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:08:58,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:08:50" (3/4) ... [2018-12-09 03:08:58,780 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 03:08:58,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:08:58,781 INFO L168 Benchmark]: Toolchain (without parser) took 9379.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -244.3 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,782 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:58,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,782 INFO L168 Benchmark]: Boogie Preprocessor took 62.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,783 INFO L168 Benchmark]: RCFGBuilder took 554.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.6 MB in the end (delta: 88.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,783 INFO L168 Benchmark]: TraceAbstraction took 8355.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 998.6 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:58,783 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:58,785 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 554.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.6 MB in the end (delta: 88.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8355.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 998.6 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24588 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 24586 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: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24607, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24587:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 VAL [init=1, malloc(sizeof(SSL))={24596:0}, malloc(sizeof(SSL_CTX))={24609:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24603:0}, s={24596:0}, SSLv3_server_data={24587:0}] [L1075] CALL ssl3_accept(s) VAL [init=1, s={24596:0}, SSLv3_server_data={24587:0}] [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->hit=1, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1575] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=0, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1703] __VERIFIER_error() VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=0, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 1 error locations. UNSAFE Result, 8.3s OverallTime, 36 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6806 SDtfs, 1920 SDslu, 9766 SDs, 0 SdLazy, 6239 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 70 SyntacticMatches, 66 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred 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.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 830 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3240 NumberOfCodeBlocks, 3240 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3074 ConstructedInterpolants, 0 QuantifiedInterpolants, 772152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 1434/1434 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 03:09:00,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:09:00,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:09:00,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:09:00,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:09:00,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:09:00,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:09:00,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:09:00,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:09:00,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:09:00,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:09:00,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:09:00,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:09:00,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:09:00,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:09:00,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:09:00,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:09:00,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:09:00,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:09:00,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:09:00,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:09:00,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:09:00,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:09:00,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:09:00,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:09:00,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:09:00,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:09:00,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:09:00,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:09:00,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:09:00,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:09:00,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:09:00,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:09:00,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:09:00,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:09:00,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:09:00,091 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 03:09:00,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:09:00,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:09:00,102 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:09:00,102 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:09:00,102 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:09:00,103 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:09:00,103 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:09:00,103 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:09:00,103 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:09:00,103 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:09:00,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:09:00,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:09:00,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:09:00,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:09:00,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:09:00,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:09:00,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 03:09:00,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:09:00,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:09:00,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:09:00,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:09:00,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:09:00,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:09:00,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 03:09:00,107 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 03:09:00,108 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_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 734374bd08e5d81d02921a162508af5871b3609e [2018-12-09 03:09:00,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:09:00,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:09:00,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:09:00,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:09:00,141 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:09:00,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-09 03:09:00,179 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/f2bf61b42/ac478672cd89492aac9f9a13546bbc16/FLAG3006bb219 [2018-12-09 03:09:00,563 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:09:00,563 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-09 03:09:00,572 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/f2bf61b42/ac478672cd89492aac9f9a13546bbc16/FLAG3006bb219 [2018-12-09 03:09:00,925 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0e6f01a-2215-43bd-9c40-57ef88511aff/bin-2019/utaipan/data/f2bf61b42/ac478672cd89492aac9f9a13546bbc16 [2018-12-09 03:09:00,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:09:00,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:09:00,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:09:00,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:09:00,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:09:00,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:09:00" (1/1) ... [2018-12-09 03:09:00,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bff49fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:09:00, skipping insertion in model container [2018-12-09 03:09:00,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:09:00" (1/1) ... [2018-12-09 03:09:00,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:09:00,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:09:01,206 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:09:01,218 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:09:01,349 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:09:01,350 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 03:09:01,353 INFO L168 Benchmark]: Toolchain (without parser) took 424.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-09 03:09:01,354 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:09:01,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-09 03:09:01,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...